@inproceedings{Meyer2014,
  author    = {Peter Meyer},
  title     = {Advanced graph-based searches in an Internet dictionary portal},
  series = {Electronic lexicography in the 21st century: thinking outside the paper. Proceedings of the eLex 2013 conference, 17-19 October 2013, Tallinn, Estonia},
  editor    = {Iztok Kosem and Polona Gantar and Simon Krek and Margit Langemets and Mari Tuulik},
  publisher = {Trojina, Institute for Applied Slovene Studies/Eesti Keele Instituut},
  address   = {Ljubljana/Tallinn},
  url       = {https://nbn-resolving.org/urn:nbn:de:bsz:mh39-28380},
  pages     = {488 -- 502},
  year      = {2014},
  abstract  = {The web portal Lehnwortportal Deutsch (lwp.ids-mannheim.de), developed at the Institute for the German Language (IDS), aims to provide unified access to existing and possibly new dictionaries of German loanwords in other languages. Internally, the lexicographical information is represented as a directed acyclic graph of relations between words. The graph abstracts from the idiosyncrasies of the individual component dictionaries. This paper explores two different strategies to make complex graph-based cross-dictionary queries in such a portal more accessible to users. The first strategy effectively hides the underlying graph structure, but allows users to assign scopes (internally defined in terms of the graph structure) to search criteria. A second type of search strategy directly formulates queries in terms of the relational graph structure. In this case, search results are not entries but n-tuples of words (metalemmata, loanwords, etyma); a query consists of specifying properties of these words and relations between them. A working prototype of an easy-to-use human-readable declarative query language is presented and ways to interactively construct queries are discussed.},
  language  = {en}
}