| 1 |
Integrating Lexical and Temporal Signals in Neural Ranking Models for Searching Social Media Streams ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 2 |
A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars
|
|
|
|
In: Prague Bulletin of Mathematical Linguistics , Vol 103, Iss 1, Pp 139-159 (2015) (2015)
|
|
Abstract:
This paper describes the design and implementation of a Python-based interface for wide coverage Lexicalized Tree-adjoining Grammars. The grammars are part of the XTAG Grammar project at the University of Pennsylvania, which were hand-written and semi-automatically curated to parse real-world corpora. We provide an interface to the wide coverage English and Korean XTAG grammars. Each XTAG grammar is lexicalized, which means at least one word selects a tree fragment (called an elementary tree or etree). Derivations for sentences are built by combining etrees using substitution (replacement of a tree node with an etree at the frontier of another etree) and adjunction (replacement of an internal tree node in an etree by another etree). Each etree is associated with a feature structure representing constraints on substitution and adjunction. Feature structures are combined using unification during the combination of etrees. We plan to integrate our toolkit for XTAG grammars into the Python-based Natural Language Toolkit (NLTK: nltk.org). We have provided an API capable of searching the lexicalized etrees for a given word or multiple words, searching for a etree by name or function, display the lexicalized etrees to the user using a graphical view, display the feature structure associated with each tree node in an etree, hide or highlight features based on a regular expression, and browsing the entire tree database for each XTAG grammar.
|
|
Keyword:
Computational linguistics. Natural language processing; P98-98.5
|
|
URL: https://doi.org/10.1515/pralin-2015-0008
https://doaj.org/article/22c9d526b36b40dd935b93b116f422ad
|
|
BASE
|
|
Hide details
|
|
|
|
|
