| Titel: |
A logical dictionary with granular process definitions |
| Personen: | Pease, Adam/Švarný, Michal |
| Jahr: |
2013 |
| Typ: |
Aufsatz |
| Verlag: |
The Asian Association for Lexicography |
| Ortsangabe: |
Kyoto |
| In: |
Kwary, Deny A./Wulan, Nur/Musyahda, Lilla (Hgg.): Lexicography and Dictionaries in the Information Age. Proceedings of the ASIALEX 8th International Conference 2013. Bali, Indonesia, 20 - 22 August 2013 |
| Seiten: |
312-319 |
| Schlagwörter: |
Bedeutungserläuterung/Definition*paraphrase/definition
Datenbank*data base
semantische Relationen im Wörterbuch*semantic/sense relations in dictionaries
|
| URI: |
https://asialex.org/pdf/Asialex-Proceedings-2013.pdf |
| Zuletzt besucht: |
19.10.2020 |
| Abstract: |
An underexplored topic in computational lexicography is the creation of formal and computable theories in logic that define the meaning of words. In this work, we introduce the Suggested Upper Merged Ontology (SUMO) (Niles & Pease 2001) (Pease, 2011) as an interlingual resource for lexicographic definition, and concentrate in particular on an exploration of process granularity. The definition of many words depends on their mereological composition. Words that are considered mass nouns or substances in English such as water are subdivisible while retaining their identity, but only to a certain granularity. Processes have similar characteristics with progressives behaving akin to substances. The notion of walking can be subdivided temporally, but only to the point where it becomes a
single step or small body motion. Capturing these distinctions in dictionaries has typically been dependent upon the surface syntactic features of given languages, limiting the utility and reuse of lexicographic resources across languages. The present research is an attempt to examine and rectify this issue. We hope also that having linguistically independent definitions will help in clarifying linguistic differences between pairs of languages, even when particular verbs may be considered cross-linguistic near synonyms. In addition, we implement these definitions in a computable language with an associated formal theorem prover that can check the definitions we create for logical consistency. |