Search results
Results from the WOW.Com Content Network
Shallow semantic parsing is concerned with identifying entities in an utterance and labelling them with the roles they play. Shallow semantic parsing is sometimes known as slot-filling or frame semantic parsing, since its theoretical basis comes from frame semantics, wherein a word evokes a frame of related concepts and roles.
Part-of-speech tagging (which resolves some semantic ambiguity) is a related problem, and often a prerequisite for or a subproblem of syntactic parsing. Syntactic parses can be used for information extraction (e.g. event parsing, semantic role labelling, entity labelling) and may be further used to extract formal semantic representations.
In natural language processing, semantic role labeling (also called shallow semantic parsing or slot-filling) is the process that assigns labels to words or phrases in a sentence that indicates their semantic role in the sentence, such as that of an agent, goal, or result. It serves to find the meaning of the sentence.
Deep linguistic processing is a natural language processing framework which draws on theoretical and descriptive linguistics.It models language predominantly by way of theoretical syntactic/semantic theory (e.g. CCG, HPSG, LFG, TAG, the Prague School).
Combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive grammar formalism.It has a transparent interface between surface syntax and underlying semantic representation, including predicate–argument structure, quantification and information structure.
Computational semantics is the study of how to automate the process of constructing and reasoning with meaning representations of natural language expressions. [1] It consequently plays an important role in natural-language processing and computational linguistics.
A notable example of deep semantic annotation is the Groningen Meaning Bank, developed at the University of Groningen and annotated using Discourse Representation Theory. An example of a shallow semantic treebank is PropBank , which provides annotation of verbal propositions and their arguments, without attempting to represent every word in the ...
A parsing expression is a kind of pattern that each string may either match or not match.In case of a match, there is a unique prefix of the string (which may be the whole string, the empty string, or something in between) which has been consumed by the parsing expression; this prefix is what one would usually think of as having matched the expression.