背带
发表于 2025-3-30 11:50:19
Syntactic Spreadsheets: In Search for a Human-Readable Representation of Parse Tree Forests generated by Świdziński’s grammar, the representation can be used for any grammar handled by Woliński’s Birnam parser, and the basic ideas can be applied to any Immediate Constituent grammar. Syntactic spreadsheets can serve several purposes. They can be simply included in printed publications or d
特别容易碎
发表于 2025-3-30 16:19:13
http://reply.papertrans.cn/43/4293/429289/429289_52.png
Alopecia-Areata
发表于 2025-3-30 16:39:38
Spejd: A Shallow Processing and Morphological Disambiguation Toolcase of other shallow parsing formalisms, the rules of the grammar allow for explicit morphosyntactic disambiguation statements, independently of structure-building statements, which facilitates the task of the shallow parsing of morphosyntactically ambiguous or erroneously disambiguated input.
Nuance
发表于 2025-3-30 20:58:17
http://reply.papertrans.cn/43/4293/429289/429289_54.png
membrane
发表于 2025-3-31 02:23:53
A Measure of the Number of True Analogies between Chunks in Japaneseanalogies between chunks in a language with case markers, Japanese. On a bicorpus of 20,000 sentences, we show that at least 96% of the analogies of form between chunks are also analogies of meaning, thus reporting the presence of at least two million true analogies between chunks in this corpus. As
SIT
发表于 2025-3-31 06:27:43
http://reply.papertrans.cn/43/4293/429289/429289_56.png
协议
发表于 2025-3-31 10:25:48
Mining Parsing Results for Lexical Correction: Toward a Complete Correction Process of Wide-Coverageis an intricate and demanding task. We introduce a automatic process for detecting missing, incomplete and erroneous entries in a morphological and syntactic lexicon, and for suggesting corrections hypotheses for these entries. The detection of dubious lexical entries is tackled by two different tec
Nucleate
发表于 2025-3-31 14:12:24
Efficient Parsing Using Recursive Transition Networks with Outputsive transition networks with string output (RTNSO). RTNSO-based grammars can be semiautomatically built from samples of a manually built syntactic lexicon. Efficient parsing algorithms are needed to minimize the temporal cost associated to the size of the resulting networks. We focus our algorithms
ARCH
发表于 2025-3-31 20:06:42
Automatically Determining Attitude Type and Force for Sentiment Analysisis. Such methods, however, require the construction of large and complex lexicons, giving values for multiple sentiment-related attributes to many different lexical items. For example, a key attribute is what type of . is expressed by a lexical item; e.g., . expresses appreciation of an object’s qua
乳汁
发表于 2025-4-1 00:46:42
http://reply.papertrans.cn/43/4293/429289/429289_60.png