# Strings for Search Word
sUI = "fr"
def selectLang (sLang):
global sUI
if sLang in dStrings:
sUI = sLang
def get (sMsgCode):
try:
return dStrings[sUI].get(sMsgCode, sMsgCode)
except:
return "#error"
dStrings = {
"fr": {
"title": "Grammalecte · Recherche et informations",
"search_section": "Recherche",
"similar_search_section": "Graphies similaires",
"similar_search_button": "Chercher",
"regex_search_section": "Expression régulières",
"flexion": "Flexion",
"tags": "Étiquettes",
"regex_search_button": "Chercher",
"result_warning": "La recherche par expressions régulières peut générer un nombre gigantesque de résultats. Seules les 2000 premières occurrences trouvées seront affichées. La recherche peut être longue, parce tout le graphe de mots, qui contient 500 000 flexions, sera parcouru si besoin.",
"result_section": "Résultats",
"res_flexion": "Flexions",
"res_lemma": "Lemmes",
"res_tags": "Étiquettes",
"close_button": "Fermer",
"error": "Erreur",
"regex_error_flexion": "L’expression régulière du champ ‹Flexion› est erronée.",
"regex_error_tags": "L’expression régulière du champ ‹Étiquettes› est erronée."
},
"en": {
"title": "Grammalecte · Search and informations",
"search_section": "Search",
"similar_search_section": "Similar words",
"similar_search_button": "Search",
"regex_search_section": "Regular expressions",
"flexion": "Flexion",
"tags": "Tags",
"regex_search_button": "Search",
"result_warning": "Search via regular expressions can generate a huge amount of results. Only the first 2000 occurrences found will be displayed. Search may be long as the full word graph, which contains 500,000 flexions, will be parsed if required.",
"result_section": "Results",
"res_flexion": "Flexions",
"res_lemma": "Lemmas",
"res_tags": "Tags",
"close_button": "Close",
"error": "Error",
"regex_error_flexion": "The regular expression in field ‹Flexion› is wrong.",
"regex_error_tags": "The regular expression in field ‹Tags› is wrong."
},
}