Open AccessTransparency and Building Lexical Dependency Graphs
Author(s) -
Charles J. Fillmore,
H. Sato
Publication year - 2002
Publication title -
proceedings of the annual meeting of the berkeley linguistics society
Language(s) - English
Resource type - Journals
eISSN - 2377-1666
pISSN - 0363-2946
DOI - 10.3765/bls.v28i1.3825
Subject(s) - framenet , computer science , transparency (behavior) , lexicon , dependency (uml) , context (archaeology) , verb , process (computing) , artificial intelligence , natural language processing , word (group theory) , computational linguistics , lexicographical order , linguistics , parsing , programming language , paleontology , philosophy , computer security , biology , mathematics , combinatorics
The authors are participants in a project, called "FrameNet" which is aimed at building a large computer lexicon of contemporary written English and making it accessible through the World Wide Web for both computational and lexicographic interests. In the process of designing this resource, we have to keep in mind how it can serve its intended applications. A prerequisite to most imaginable NLP applications is word sense disambiguation (WSD), the automatic process by which a word in a linguistic context can be (probabilistically) assigned its locally intended meaning. This paper will introduce FrameNet and will characterize a facility, based on its tools and data, that could in principle be directed to WSD efforts, and will suggest how both technical (engineering) and linguistic considerations must be called on to build it.