Test page for webservice "Topographische Namen"
Please select the desired service
Search Query Parameter
The Levenshtein distance is a string metric for measuring the difference between two sequences.
Informally, the Levenshtein distance between two words is the minimum number of single-character
edits (i.e. insertions, deletions or substitutions) required to change one word into the other.
Select integer between 0 and 5
Boundig box: comma separated list of minimum and maximum coordinate for geographic intersection. (CH03)
Intersection Query Parameter
Square root of the minimum quotient between intersection area and toponame area.