Natural language processing

<h2 id="history">History</h2>
Further information: <a href="/facts/History_of_natural_language_processing/TAeTF7qI">History of natural language processing</a>
Natural language processing has its roots in the 1950s.<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a> Already in 1950, <a href="/facts/Alan_Turing/klov9b6g">Alan Turing</a> published an article titled "<a href="/facts/Computing_Machinery_and_Intelligence/mSP1X3W9">Computing Machinery and Intelligence</a>" which proposed what is now called the <a href="/facts/Turing_test/wEvf9DIr">Turing test</a> as a criterion of intelligence, though at the time that was not articulated as a problem separate from artificial intelligence. The proposed test includes a task that involves the automated interpretation and generation of natural language.

<h3>Symbolic NLP (1950s – early 1990s)</h3>
The premise of symbolic NLP is well-summarized by <a href="/facts/John_Searle/YDMljSH7">John Searle</a>'s <a href="/facts/Chinese_room/YeKegsxS">Chinese room</a> experiment: Given a collection of rules (e.g., a Chinese phrasebook, with questions and matching answers), the computer emulates natural language understanding (or other NLP tasks) by applying those rules to the data it confronts.

<ul><li>1950s: The <a href="/facts/Georgetown-IBM_experiment/92CVHtkd">Georgetown experiment</a> in 1954 involved fully <a href="/facts/Automatic_translation/DGF3NwuI">automatic translation</a> of more than sixty Russian sentences into English. The authors claimed that within three or five years, machine translation would be a solved problem.<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a> However, real progress was much slower, and after the <a href="/facts/ALPAC/mKEEzDEw">ALPAC report</a> in 1966, which found that ten years of research had failed to fulfill the expectations, funding for machine translation was dramatically reduced. Little further research in machine translation was conducted in America (though some research continued elsewhere, such as Japan and Europe<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a>) until the late 1980s when the first <a href="/facts/Statistical_machine_translation/rzJ8Gfyj">statistical machine translation</a> systems were developed.</li>
<li>1960s: Some notably successful natural language processing systems developed in the 1960s were <a href="/facts/SHRDLU/3l6Tu7np">SHRDLU</a>, a natural language system working in restricted "<a href="/facts/Blocks_world/Bq1aDx6J">blocks worlds</a>" with restricted vocabularies, and <a href="/facts/ELIZA/e2Frdz7f">ELIZA</a>, a simulation of a <a href="/facts/Rogerian_psychotherapy/GULq0w4S">Rogerian psychotherapist</a>, written by <a href="/facts/Joseph_Weizenbaum/Sy2f7I4h">Joseph Weizenbaum</a> between 1964 and 1966. Using almost no information about human thought or emotion, ELIZA sometimes provided a startlingly human-like interaction. When the "patient" exceeded the very small knowledge base, ELIZA might provide a generic response, for example, responding to "My head hurts" with "Why do you say your head hurts?". Ross Quillian's successful work on natural language was demonstrated with a vocabulary of only twenty words, because that was all that would fit in a computer memory at the time.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a></li></ul>
<ul><li>1970s: During the 1970s, many programmers began to write "conceptual <a href="/facts/Ontology_(information_science)/SQlhl6lp">ontologies</a>", which structured real-world information into computer-understandable data. Examples are MARGIE (Schank, 1975), SAM (Cullingford, 1978), PAM (Wilensky, 1978), TaleSpin (Meehan, 1976), QUALM (Lehnert, 1977), Politics (Carbonell, 1979), and Plot Units (Lehnert 1981). During this time, the first <a href="/facts/Chatterbots/kASkMjs7">chatterbots</a> were written (e.g., <a href="/facts/PARRY/PwDRceo7">PARRY</a>).</li>
<li>1980s: The 1980s and early 1990s mark the heyday of symbolic methods in NLP. Focus areas of the time included research on rule-based parsing (e.g., the development of <a href="/facts/Head-driven_phrase_structure_grammar/MW1TXsca">HPSG</a> as a computational operationalization of <a href="/facts/Generative_grammar/Pm1AMX5U">generative grammar</a>), morphology (e.g., two-level morphology<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a>), semantics (e.g., <a href="/facts/Lesk_algorithm/UsVqWKNj">Lesk algorithm</a>), reference (e.g., within Centering Theory<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a>) and other areas of natural language understanding (e.g., in the <a href="/facts/Rhetorical_structure_theory/CHn0H4zN">Rhetorical Structure Theory</a>). Other lines of research were continued, e.g., the development of chatterbots with <a href="/facts/Racter/50AdrwKf">Racter</a> and <a href="/facts/Jabberwacky/n5lShuKC">Jabberwacky</a>. An important development (that eventually led to the statistical turn in the 1990s) was the rising importance of quantitative evaluation in this period.<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a></li></ul>
<h3>Statistical NLP (1990s–present)</h3>
Up until the 1980s, most natural language processing systems were based on complex sets of hand-written rules. Starting in the late 1980s, however, there was a revolution in natural language processing with the introduction of <a href="/facts/Machine_learning/e0w0XJTu">machine learning</a> algorithms for language processing. This was due to both the steady increase in computational power (see <a href="/facts/Moore%2527s_law/90CSekhl">Moore's law</a>) and the gradual lessening of the dominance of <a href="/facts/Noam_Chomsky/3rtpzlER">Chomskyan</a> theories of linguistics (e.g. <a href="/facts/Transformational_grammar/vqIyVYdP">transformational grammar</a>), whose theoretical underpinnings discouraged the sort of <a href="/facts/Corpus_linguistics/uxRe9Uj8">corpus linguistics</a> that underlies the machine-learning approach to language processing.<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> 

<ul><li>1990s: Many of the notable early successes in statistical methods in NLP occurred in the field of <a href="/facts/Machine_translation/DGF3NwuI">machine translation</a>, due especially to work at IBM Research, such as <a href="/facts/IBM_alignment_models/hYfsl0K7">IBM alignment models</a>. These systems were able to take advantage of existing multilingual <a href="/facts/Text_corpus/bYeEQQdh">textual corpora</a> that had been produced by the <a href="/facts/Parliament_of_Canada/4YQfaTxt">Parliament of Canada</a> and the <a href="/facts/European_Union/6GYcR8qM">European Union</a> as a result of laws calling for the translation of all governmental proceedings into all official languages of the corresponding systems of government. However, most other systems depended on corpora specifically developed for the tasks implemented by these systems, which was (and often continues to be) a major limitation in the success of these systems. As a result, a great deal of research has gone into methods of more effectively learning from limited amounts of data.</li>
<li>2000s: With the growth of the web, increasing amounts of raw (unannotated) language data have become available since the mid-1990s. Research has thus increasingly focused on <a href="/facts/Unsupervised_learning/8a6f61MC">unsupervised</a> and <a href="/facts/Semi-supervised_learning/4mzcqFjI">semi-supervised learning</a> algorithms. Such algorithms can learn from data that has not been hand-annotated with the desired answers or using a combination of annotated and non-annotated data. Generally, this task is much more difficult than <a href="/facts/Supervised_learning/JlNFNPFt">supervised learning</a>, and typically produces less accurate results for a given amount of input data. However, there is an enormous amount of non-annotated data available (including, among other things, the entire content of the <a href="/facts/World_Wide_Web/wvnTrWFq">World Wide Web</a>), which can often make up for the worse efficiency if the algorithm used has a low enough <a href="/facts/Time_complexity/77T62gmf">time complexity</a> to be practical.</li>
<li>2003: <a href="/facts/Word_n-gram_language_model/6dkbUpdL">word n-gram model</a>, at the time the best statistical algorithm, is outperformed by a <a href="/facts/Multi-layer_perceptron/jkq4t7Gy">multi-layer perceptron</a> (with a single hidden layer and context length of several words, trained on up to 14 million words, by <a href="/facts/Yoshua_Bengio/796atWBU">Bengio</a> et al.)<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a></li>
<li>2010: <a href="/facts/Tom%25C3%25A1%25C5%25A1_Mikolov/3WlvSdBT">Tomáš Mikolov</a> (then a PhD student at <a href="/facts/Brno_University_of_Technology/hv6lz9Yq">Brno University of Technology</a>) with co-authors applied a simple <a href="/facts/Recurrent_neural_network/bx7hBVB1">recurrent neural network</a> with a single hidden layer to language modelling,<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a> and in the following years he went on to develop <a href="/facts/Word2vec/DAuubBYX">Word2vec</a>. In the 2010s, <a href="/facts/Representation_learning/6GYV0mux">representation learning</a> and <a href="/facts/Deep_learning/JLuwD3ea">deep neural network</a>-style (featuring many hidden layers) machine learning methods became widespread in natural language processing. That popularity was due partly to a flurry of results showing that such techniques<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a><a class="footnote-ref" id="fnref:12" href="#fn:12">12</a> can achieve state-of-the-art results in many natural language tasks, e.g., in <a href="/facts/Language_modeling/FntSpg0j">language modeling</a><a class="footnote-ref" id="fnref:13" href="#fn:13">13</a> and parsing.<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a><a class="footnote-ref" id="fnref:15" href="#fn:15">15</a> This is increasingly important <a href="/facts/Artificial_intelligence_in_healthcare/zCxMXHjG">in medicine and healthcare</a>, where NLP helps analyze notes and text in <a href="/facts/Electronic_health_record/0my0rktq">electronic health records</a> that would otherwise be inaccessible for study when seeking to improve care<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a> or protect patient privacy.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a></li></ul>
<h2 id="approaches-symbolic-statistical-neural-networks">Approaches: Symbolic, statistical, neural networks</h2>
Symbolic approach, i.e., the hand-coding of a set of rules for manipulating symbols, coupled with a dictionary lookup, was historically the first approach used both by AI in general and by NLP in particular:<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a><a class="footnote-ref" id="fnref:19" href="#fn:19">19</a> such as by writing grammars or devising heuristic rules for <a href="/facts/Stemming/lqtKp4X7">stemming</a>.
<a href="/facts/Machine_learning/e0w0XJTu">Machine learning</a> approaches, which include both statistical and neural networks, on the other hand, have many advantages over the symbolic approach: 

<ul><li>both statistical and neural networks methods can focus more on the most common cases extracted from a corpus of texts, whereas the rule-based approach needs to provide rules for both rare cases and common ones equally.</li></ul>
<ul><li><a href="/facts/Language_model/FntSpg0j">language models</a>, produced by either statistical or neural networks methods, are more robust to both unfamiliar (e.g. containing words or structures that have not been seen before) and erroneous input (e.g. with misspelled words or words accidentally omitted) in comparison to the rule-based systems, which are also more costly to produce.</li></ul>
<ul><li>the larger such a (probabilistic) language model is, the more accurate it becomes, in contrast to rule-based systems that can gain accuracy only by increasing the amount and complexity of the rules leading to <a href="/facts/Intractable_problem/etHuVF3U">intractability</a> problems.</li></ul>
Rule-based systems are commonly used:

<ul><li>when the amount of training data is insufficient to successfully apply machine learning methods, e.g., for the machine translation of low-resource languages such as provided by the <a href="/facts/Apertium/BHhyqPpV">Apertium</a> system,</li>
<li>for preprocessing in NLP pipelines, e.g., <a href="/facts/Tokenization_(lexical_analysis)/T1JYWpIf">tokenization</a>, or</li>
<li>for postprocessing and transforming the output of NLP pipelines, e.g., for <a href="/facts/Knowledge_extraction/eopEv228">knowledge extraction</a> from syntactic parses.</li></ul>
<h3>Statistical approach</h3>
In the late 1980s and mid-1990s, the statistical approach ended a period of <a href="/facts/AI_winter/DLpU1wxl">AI winter</a>, which was caused by the inefficiencies of the rule-based approaches.<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a><a class="footnote-ref" id="fnref:21" href="#fn:21">21</a>
The earliest <a href="/facts/Decision_tree/XDVeGlkJ">decision trees</a>, producing systems of hard <a href="/facts/Conditional_(computer_programming)/8gDQTqUD">if–then rules</a>, were still very similar to the old rule-based approaches.
Only the introduction of hidden <a href="/facts/Markov_model/Mlndun4Q">Markov models</a>, applied to part-of-speech tagging, announced the end of the old rule-based approach.

<h3>Neural networks</h3>
Further information: <a href="/facts/Artificial_neural_network/6V1jMlkx">Artificial neural network</a>
A major drawback of statistical methods is that they require elaborate <a href="/facts/Feature_engineering/VkNJFAFb">feature engineering</a>. Since 2015,<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a> the statistical approach has been replaced by the <a href="/facts/Artificial_neural_network/6V1jMlkx">neural networks</a> approach, using <a href="/facts/Semantic_networks/mt7FlP53">semantic networks</a><a class="footnote-ref" id="fnref:23" href="#fn:23">23</a> and <a href="/facts/Word_embedding/7uRcBPqo">word embeddings</a> to capture semantic properties of words. 
Intermediate tasks (e.g., part-of-speech tagging and dependency parsing) are not needed anymore. 
<a href="/facts/Neural_machine_translation/BsjdmTSt">Neural machine translation</a>, based on then-newly invented <a href="/facts/Seq2seq/t0XBoV4t">sequence-to-sequence</a> transformations, made obsolete the intermediate steps, such as word alignment, previously necessary for <a href="/facts/Statistical_machine_translation/rzJ8Gfyj">statistical machine translation</a>.

<h2 id="common-nlp-tasks">Common NLP tasks</h2>
The following is a list of some of the most commonly researched tasks in natural language processing. Some of these tasks have direct real-world applications, while others more commonly serve as subtasks that are used to aid in solving larger tasks.
Though natural language processing tasks are closely intertwined, they can be subdivided into categories for convenience. A coarse division is given below.

<h3>Text and speech processing</h3>
<a href="/facts/Optical_character_recognition/kdTyxa1l">Optical character recognition</a> (OCR)
Given an image representing printed text, determine the corresponding text.
<a href="/facts/Speech_recognition/z7S7Pgk6">Speech recognition</a>
Given a sound clip of a person or people speaking, determine the textual representation of the speech. This is the opposite of <a href="/facts/Text_to_speech/ceTczTv9">text to speech</a> and is one of the extremely difficult problems colloquially termed "<a href="/facts/AI-complete/Ik4mAVRy">AI-complete</a>" (see above). In <a href="/facts/Natural_speech/B4gLS7Kd">natural speech</a> there are hardly any pauses between successive words, and thus <a href="/facts/Speech_segmentation/UCoL3rfQ">speech segmentation</a> is a necessary subtask of speech recognition (see below). In most spoken languages, the sounds representing successive letters blend into each other in a process termed <a href="/facts/Coarticulation/gDbw2dVR">coarticulation</a>, so the conversion of the <a href="/facts/Analog_signal/xDbb4uB5">analog signal</a> to discrete characters can be a very difficult process. Also, given that words in the same language are spoken by people with different accents, the speech recognition software must be able to recognize the wide variety of input as being identical to each other in terms of its textual equivalent.
<a href="/facts/Speech_segmentation/UCoL3rfQ">Speech segmentation</a>
Given a sound clip of a person or people speaking, separate it into words. A subtask of <a href="/facts/Speech_recognition/z7S7Pgk6">speech recognition</a> and typically grouped with it.
<a href="/facts/Text-to-speech/ceTczTv9">Text-to-speech</a>
Given a text, transform those units and produce a spoken representation. Text-to-speech can be used to aid the visually impaired.<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a>
<a href="/facts/Word_segmentation/odzhLLQt">Word segmentation</a> (<a href="/facts/Tokenization_(lexical_analysis)/T1JYWpIf">Tokenization</a>)
Tokenization is a process used in text analysis that divides text into individual words or word fragments. This technique results in two key components: a word index and tokenized text. The word index is a list that maps unique words to specific numerical identifiers, and the tokenized text replaces each word with its corresponding numerical token. These numerical tokens are then used in various deep learning methods.<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a>
For a language like <a href="/facts/English_language/tpkxGt7b">English</a>, this is fairly trivial, since words are usually separated by spaces. However, some written languages like <a href="/facts/Chinese_language/771ruUY1">Chinese</a>, <a href="/facts/Japanese_language/EEv485a5">Japanese</a> and <a href="/facts/Thai_language/PnaLdG77">Thai</a> do not mark word boundaries in such a fashion, and in those languages text segmentation is a significant task requiring knowledge of the <a href="/facts/Vocabulary/gUfoY6TJ">vocabulary</a> and <a href="/facts/Morphology_(linguistics)/fWkzsYE8">morphology</a> of words in the language. Sometimes this process is also used in cases like <a href="/facts/Bag_of_words/TlhIx600">bag of words</a> (BOW) creation in data mining.
<h3>Morphological analysis</h3>
<a href="/facts/Lemmatisation/eGz6L9yE">Lemmatization</a>
The task of removing inflectional endings only and to return the base dictionary form of a word which is also known as a lemma. Lemmatization is another technique for reducing words to their normalized form. But in this case, the transformation actually uses a dictionary to map words to their actual form.<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a>
<a href="/facts/Morphology_(linguistics)/fWkzsYE8">Morphological segmentation</a>
Separate words into individual <a href="/facts/Morpheme/4JNcPMHs">morphemes</a> and identify the class of the morphemes. The difficulty of this task depends greatly on the complexity of the <a href="/facts/Morphology_(linguistics)/fWkzsYE8">morphology</a> (i.e., the structure of words) of the language being considered. <a href="/facts/English_language/tpkxGt7b">English</a> has fairly simple morphology, especially <a href="/facts/Inflectional_morphology/mhXSXpmJ">inflectional morphology</a>, and thus it is often possible to ignore this task entirely and simply model all possible forms of a word (e.g., "open, opens, opened, opening") as separate words. In languages such as <a href="/facts/Turkish_language/C5X56Ijp">Turkish</a> or <a href="/facts/Meitei_language/SwBGUkeR">Meitei</a>, a highly <a href="/facts/Agglutination/pKEhqgRE">agglutinated</a> Indian language, however, such an approach is not possible, as each dictionary entry has thousands of possible word forms.<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a>
<a href="/facts/Part-of-speech_tagging/BYAPmH3r">Part-of-speech tagging</a>
Given a sentence, determine the <a href="/facts/Part_of_speech/WbQ89MHX">part of speech</a> (POS) for each word. Many words, especially common ones, can serve as multiple parts of speech. For example, "book" can be a <a href="/facts/Noun/SsnDNfkX">noun</a> ("the book on the table") or <a href="/facts/Verb/zp42buvn">verb</a> ("to book a flight"); "set" can be a noun, verb or <a href="/facts/Adjective/0ohBjtmT">adjective</a>; and "out" can be any of at least five different parts of speech.
<a href="/facts/Stemming/lqtKp4X7">Stemming</a>
The process of reducing inflected (or sometimes derived) words to a base form (e.g., "close" will be the root for "closed", "closing", "close", "closer" etc.). Stemming yields similar results as lemmatization, but does so on grounds of rules, not a dictionary.
<h3>Syntactic analysis</h3>

<a href="/facts/Grammar_induction/Mx8ISTor">Grammar induction</a><a class="footnote-ref" id="fnref:28" href="#fn:28">28</a>
Generate a <a href="/facts/Formal_grammar/QLxaQNAz">formal grammar</a> that describes a language's syntax.
<a href="/facts/Sentence_breaking/LIJgNnGX">Sentence breaking</a> (also known as "<a href="/facts/Sentence_boundary_disambiguation/LIJgNnGX">sentence boundary disambiguation</a>")
Given a chunk of text, find the sentence boundaries. Sentence boundaries are often marked by <a href="/facts/Full_stop/w0Ylafwn">periods</a> or other <a href="/facts/Punctuation_mark/YsE7u4W6">punctuation marks</a>, but these same characters can serve other purposes (e.g., marking <a href="/facts/Abbreviation/VxBQfhII">abbreviations</a>).
<a href="/facts/Parsing/nRKB01S3">Parsing</a>
Determine the <a href="/facts/Parse_tree/FeBEtXcz">parse tree</a> (grammatical analysis) of a given sentence. The <a href="/facts/Grammar/vprQsHIR">grammar</a> for <a href="/facts/Natural_language/B4gLS7Kd">natural languages</a> is <a href="/facts/Ambiguous/mgn4oEoQ">ambiguous</a> and typical sentences have multiple possible analyses: perhaps surprisingly, for a typical sentence there may be thousands of potential parses (most of which will seem completely nonsensical to a human). There are two primary types of parsing: dependency parsing and constituency parsing. Dependency parsing focuses on the relationships between words in a sentence (marking things like primary objects and predicates), whereas constituency parsing focuses on building out the parse tree using a <a href="/facts/Probabilistic_context-free_grammar/84Ps7P9j">probabilistic context-free grammar</a> (PCFG) (see also <a href="/facts/Stochastic_grammar/K0Gpnqp5">stochastic grammar</a>).
<h3>Lexical semantics (of individual words in context)</h3>
<a href="/facts/Lexical_semantics/CyyMMxuK">Lexical semantics</a>
What is the computational meaning of individual words in context?
<a href="/facts/Distributional_semantics/klV0l6o7">Distributional semantics</a>
How can we learn semantic representations from data?
<a href="/facts/Named_entity_recognition/ko6GRQQd">Named entity recognition</a> (NER)
Given a stream of text, determine which items in the text map to proper names, such as people or places, and what the type of each such name is (e.g. person, location, organization). Although <a href="/facts/Capitalization/eJx3dTaq">capitalization</a> can aid in recognizing named entities in languages such as English, this information cannot aid in determining the type of <a href="/facts/Named_entity/pqC6pucA">named entity</a>, and in any case, is often inaccurate or insufficient. For example, the first letter of a sentence is also capitalized, and named entities often span several words, only some of which are capitalized. Furthermore, many other languages in non-Western scripts (e.g. <a href="/facts/Chinese_language/771ruUY1">Chinese</a> or <a href="/facts/Arabic_language/A1e66hVV">Arabic</a>) do not have any capitalization at all, and even languages with capitalization may not consistently use it to distinguish names. For example, <a href="/facts/German_language/oWaQIDA8">German</a> capitalizes all <a href="/facts/Noun/SsnDNfkX">nouns</a>, regardless of whether they are names, and <a href="/facts/French_language/qe1DnaQh">French</a> and <a href="/facts/Spanish_language/95BgYNfv">Spanish</a> do not capitalize names that serve as <a href="/facts/Adjective/0ohBjtmT">adjectives</a>. Another name for this task is token classification.<a class="footnote-ref" id="fnref:29" href="#fn:29">29</a>
<a href="/facts/Sentiment_analysis/QRdywf6g">Sentiment analysis</a> (see also <a href="/facts/Multimodal_sentiment_analysis/ejwvmVSr">Multimodal sentiment analysis</a>)
Sentiment analysis is a computational method used to identify and classify the emotional intent behind text. This technique involves analyzing text to determine whether the expressed sentiment is positive, negative, or neutral. Models for sentiment classification typically utilize inputs such as <a href="/facts/Word_n-gram_language_model/6dkbUpdL">word n-grams</a>, <a href="/facts/Term_frequency-inverse_document_frequency/JDzc5Jnr">Term Frequency-Inverse Document Frequency</a> (TF-IDF) features, hand-generated features, or employ <a href="/facts/Deep_learning/JLuwD3ea">deep learning</a> models designed to recognize both long-term and short-term dependencies in text sequences. The applications of sentiment analysis are diverse, extending to tasks such as categorizing customer reviews on various online platforms.<a class="footnote-ref" id="fnref:30" href="#fn:30">30</a>
<a href="/facts/Terminology_extraction/TRjKaWct">Terminology extraction</a>
The goal of terminology extraction is to automatically extract relevant terms from a given corpus.
<a href="/facts/Word-sense_disambiguation/Mfcw7gsu">Word-sense disambiguation</a> (WSD)
Many words have more than one <a href="/facts/Meaning_(linguistics)/1L4WwLAP">meaning</a>; we have to select the meaning which makes the most sense in context. For this problem, we are typically given a list of words and associated word senses, e.g. from a dictionary or an online resource such as <a href="/facts/WordNet/TbrGVGAF">WordNet</a>.
<a href="/facts/Entity_linking/bg9hGSVY">Entity linking</a>
Many words—typically proper names—refer to <a href="/facts/Named_entity/pqC6pucA">named entities</a>; here we have to select the entity (a famous individual, a location, a company, etc.) which is referred to in context.
<h3>Relational semantics (semantics of individual sentences)</h3>
<a href="/facts/Relationship_extraction/mqhXTxLN">Relationship extraction</a>
Given a chunk of text, identify the relationships among named entities (e.g. who is married to whom).
<a href="/facts/Semantic_parsing/VEwJ18nL">Semantic parsing</a>
Given a piece of text (typically a sentence), produce a formal representation of its semantics, either as a graph (e.g., in <a href="/facts/Abstract_Meaning_Representation/IAUgd4SU">AMR parsing</a>) or in accordance with a logical formalism (e.g., in <a href="/facts/Discourse_representation_theory/3c2JVcSm">DRT parsing</a>). This challenge typically includes aspects of several more elementary NLP tasks from semantics (e.g., semantic role labelling, word-sense disambiguation) and can be extended to include full-fledged discourse analysis (e.g., discourse analysis, coreference; see Natural language understanding below).
<a href="/facts/Semantic_role_labeling/mykIh41q">Semantic role labelling</a> (see also implicit semantic role labelling below)
Given a single sentence, identify and disambiguate semantic predicates (e.g., verbal <a href="/facts/Frame_semantics_(linguistics)/fclM8rvz">frames</a>), then identify and classify the frame elements (<a href="/facts/Semantic_roles/T57IHVuS">semantic roles</a>).
<h3>Discourse (semantics beyond individual sentences)</h3>
<a href="/facts/Coreference/UH4fUcND">Coreference resolution</a>
Given a sentence or larger chunk of text, determine which words ("mentions") refer to the same objects ("entities"). <a href="/facts/Anaphora_resolution/gm1WHVBF">Anaphora resolution</a> is a specific example of this task, and is specifically concerned with matching up <a href="/facts/Pronoun/UsbSNRSl">pronouns</a> with the nouns or names to which they refer. The more general task of coreference resolution also includes identifying so-called "bridging relationships" involving <a href="/facts/Referring_expression/YqQWcb39">referring expressions</a>. For example, in a sentence such as "He entered John's house through the front door", "the front door" is a referring expression and the bridging relationship to be identified is the fact that the door being referred to is the front door of John's house (rather than of some other structure that might also be referred to).
<a href="/facts/Discourse_analysis/aoqbxvVW">Discourse analysis</a>
This rubric includes several related tasks. One task is discourse parsing, i.e., identifying the <a href="/facts/Discourse/6qITpvKg">discourse</a> structure of a connected text, i.e. the nature of the discourse relationships between sentences (e.g. elaboration, explanation, contrast). Another possible task is recognizing and classifying the <a href="/facts/Speech_act/l11PGwQu">speech acts</a> in a chunk of text (e.g. yes–no question, content question, statement, assertion, etc.).
Implicit semantic role labelling
Given a single sentence, identify and disambiguate semantic predicates (e.g., verbal <a href="/facts/Frame_semantics_(linguistics)/fclM8rvz">frames</a>) and their explicit semantic roles in the current sentence (see Semantic role labelling above). Then, identify semantic roles that are not explicitly realized in the current sentence, classify them into arguments that are explicitly realized elsewhere in the text and those that are not specified, and resolve the former against the local text. A closely related task is zero anaphora resolution, i.e., the extension of coreference resolution to <a href="/facts/Pro-drop_language/c9K9lauu">pro-drop languages</a>.
<a href="/facts/Textual_entailment/6c93bq9J">Recognizing textual entailment</a>
Given two text fragments, determine if one being true entails the other, entails the other's negation, or allows the other to be either true or false.<a class="footnote-ref" id="fnref:31" href="#fn:31">31</a>
<a href="/facts/Topic_segmentation/odzhLLQt">Topic segmentation</a> and recognition
Given a chunk of text, separate it into segments each of which is devoted to a topic, and identify the topic of the segment.
<a href="/facts/Argument_mining/zEeBBIqB">Argument mining</a>
The goal of argument mining is the automatic extraction and identification of argumentative structures from <a href="/facts/Natural_language/B4gLS7Kd">natural language</a> text with the aid of computer programs.<a class="footnote-ref" id="fnref:32" href="#fn:32">32</a> Such argumentative structures include the premise, conclusions, the <a href="/facts/Argument_scheme/09o0M8T9">argument scheme</a> and the relationship between the main and subsidiary argument, or the main and counter-argument within discourse.<a class="footnote-ref" id="fnref:33" href="#fn:33">33</a><a class="footnote-ref" id="fnref:34" href="#fn:34">34</a>
<h3>Higher-level NLP applications</h3>
<a href="/facts/Automatic_summarization/yTQYaEIe">Automatic summarization</a> (text summarization)
Produce a readable summary of a chunk of text. Often used to provide summaries of the text of a known type, such as research papers, articles in the financial section of a newspaper.
Grammatical error correction
Grammatical error detection and correction involves a great band-width of problems on all levels of linguistic analysis (phonology/orthography, morphology, syntax, semantics, pragmatics). Grammatical error correction is impactful since it affects hundreds of millions of people that use or acquire English as a second language. It has thus been subject to a number of shared tasks since 2011.<a class="footnote-ref" id="fnref:35" href="#fn:35">35</a><a class="footnote-ref" id="fnref:36" href="#fn:36">36</a><a class="footnote-ref" id="fnref:37" href="#fn:37">37</a> As far as orthography, morphology, syntax and certain aspects of semantics are concerned, and due to the development of powerful neural language models such as <a href="/facts/GPT-2/U6JNeDMe">GPT-2</a>, this can now (2019) be considered a largely solved problem and is being marketed in various commercial applications.
<a href="/facts/Logic_translation/TopIkPxe">Logic translation</a>
Translate a text from a natural language into formal logic.
<a href="/facts/Machine_translation/DGF3NwuI">Machine translation</a> (MT)
Automatically translate text from one human language to another. This is one of the most difficult problems, and is a member of a class of problems colloquially termed "<a href="/facts/AI-complete/Ik4mAVRy">AI-complete</a>", i.e. requiring all of the different types of knowledge that humans possess (grammar, semantics, facts about the real world, etc.) to solve properly.
<a href="/facts/Natural-language_understanding/5waCJC1e">Natural-language understanding</a> (NLU)
Convert chunks of text into more formal representations such as <a href="/facts/First-order_logic/lcISqWIg">first-order logic</a> structures that are easier for <a href="/facts/Computer/SQe1aK05">computer</a> programs to manipulate. Natural language understanding involves the identification of the intended semantic from the multiple possible semantics which can be derived from a natural language expression which usually takes the form of organized notations of natural language concepts. Introduction and creation of language metamodel and ontology are efficient however empirical solutions. An explicit formalization of natural language semantics without confusions with implicit assumptions such as <a href="/facts/Closed-world_assumption/Fnoe5m4F">closed-world assumption</a> (CWA) vs. <a href="/facts/Open-world_assumption/o5p5wdrq">open-world assumption</a>, or subjective Yes/No vs. objective True/False is expected for the construction of a basis of semantics formalization.<a class="footnote-ref" id="fnref:38" href="#fn:38">38</a>
<a href="/facts/Natural_language_generation/qudtLU6Y">Natural-language generation</a> (NLG):
Convert information from computer databases or semantic intents into readable human language.
Book generation
Not an NLP task proper but an extension of natural language generation and other NLP tasks is the creation of full-fledged books. The first machine-generated book was created by a rule-based system in 1984 (Racter, The policeman's beard is half-constructed).<a class="footnote-ref" id="fnref:39" href="#fn:39">39</a> The first published work by a neural network was published in 2018, <a href="/facts/1_the_Road/LTDa39gg">1 the Road</a>, marketed as a novel, contains sixty million words. Both these systems are basically elaborate but non-sensical (semantics-free) <a href="/facts/Language_model/FntSpg0j">language models</a>. The first machine-generated science book was published in 2019 (Beta Writer, Lithium-Ion Batteries, Springer, Cham).<a class="footnote-ref" id="fnref:40" href="#fn:40">40</a> Unlike Racter and 1 the Road, this is grounded on factual knowledge and based on text summarization.
<a href="/facts/Document_AI/QRJcnCl1">Document AI</a>
A Document AI platform sits on top of the NLP technology enabling users with no prior experience of artificial intelligence, machine learning or NLP to quickly train a computer to extract the specific data they need from different document types. NLP-powered Document AI enables non-technical teams to quickly access information hidden in documents, for example, lawyers, business analysts and accountants.<a class="footnote-ref" id="fnref:41" href="#fn:41">41</a>
<a href="/facts/Dialogue_system/gbMVkBVf">Dialogue management</a>
Computer systems intended to converse with a human.
<a href="/facts/Question_answering/1gplmc6L">Question answering</a>
Given a human-language question, determine its answer. Typical questions have a specific right answer (such as "What is the capital of Canada?"), but sometimes open-ended questions are also considered (such as "What is the meaning of life?").
<a href="/facts/Text-to-image_generation/ez6APLzp">Text-to-image generation</a>
Given a description of an image, generate an image that matches the description.<a class="footnote-ref" id="fnref:42" href="#fn:42">42</a>
Text-to-scene generation
Given a description of a scene, generate a <a href="/facts/3D_model/6V3Ry9AJ">3D model</a> of the scene.<a class="footnote-ref" id="fnref:43" href="#fn:43">43</a><a class="footnote-ref" id="fnref:44" href="#fn:44">44</a>
<a href="/facts/Text-to-video_model/4w3n3Het">Text-to-video</a>
Given a description of a video, generate a video that matches the description.<a class="footnote-ref" id="fnref:45" href="#fn:45">45</a><a class="footnote-ref" id="fnref:46" href="#fn:46">46</a>
<h2 id="general-tendencies-and-possible-future-directions">General tendencies and (possible) future directions</h2>
Based on long-standing trends in the field, it is possible to extrapolate future directions of NLP. As of 2020, three trends among the topics of the long-standing series of CoNLL Shared Tasks can be observed:<a class="footnote-ref" id="fnref:47" href="#fn:47">47</a>

<ul><li>Interest on increasingly abstract, "cognitive" aspects of natural language (1999–2001: shallow parsing, 2002–03: named entity recognition, 2006–09/2017–18: dependency syntax, 2004–05/2008–09 semantic role labelling, 2011–12 coreference, 2015–16: discourse parsing, 2019: semantic parsing).</li>
<li>Increasing interest in multilinguality, and, potentially, multimodality (English since 1999; Spanish, Dutch since 2002; German since 2003; Bulgarian, Danish, Japanese, Portuguese, Slovenian, Swedish, Turkish since 2006; Basque, Catalan, Chinese, Greek, Hungarian, Italian, Turkish since 2007; Czech since 2009; Arabic since 2012; 2017: 40+ languages; 2018: 60+/100+ languages)</li>
<li>Elimination of symbolic representations (rule-based over supervised towards weakly supervised methods, representation learning and end-to-end systems)</li></ul>
<h3>Cognition</h3>
Most higher-level NLP applications involve aspects that emulate intelligent behaviour and apparent comprehension of natural language. More broadly speaking, the technical operationalization of increasingly advanced aspects of cognitive behaviour represents one of the developmental trajectories of NLP (see trends among CoNLL shared tasks above).
<a href="/facts/Cognition/ga0tSBul">Cognition</a> refers to "the mental action or process of acquiring knowledge and understanding through thought, experience, and the senses."<a class="footnote-ref" id="fnref:48" href="#fn:48">48</a> <a href="/facts/Cognitive_science/8qoggl7r">Cognitive science</a> is the interdisciplinary, scientific study of the mind and its processes.<a class="footnote-ref" id="fnref:49" href="#fn:49">49</a> <a href="/facts/Cognitive_linguistics/Qu4DApFf">Cognitive linguistics</a> is an interdisciplinary branch of linguistics, combining knowledge and research from both psychology and linguistics.<a class="footnote-ref" id="fnref:50" href="#fn:50">50</a> Especially during the age of symbolic NLP, the area of computational linguistics maintained strong ties with cognitive studies.
As an example, <a href="/facts/George_Lakoff/gT0I0UNd">George Lakoff</a> offers a methodology to build natural language processing (NLP) algorithms through the perspective of cognitive science, along with the findings of cognitive linguistics,<a class="footnote-ref" id="fnref:51" href="#fn:51">51</a> with two defining aspects:

<ol><li>Apply the theory of <a href="/facts/Conceptual_metaphor/FXYvNJTV">conceptual metaphor</a>, explained by Lakoff as "the understanding of one idea, in terms of another" which provides an idea of the intent of the author.<a class="footnote-ref" id="fnref:52" href="#fn:52">52</a> For example, consider the English word big. When used in a comparison ("That is a big tree"), the author's intent is to imply that the tree is physically large relative to other trees or the authors experience. When used metaphorically ("Tomorrow is a big day"), the author's intent to imply importance. The intent behind other usages, like in "She is a big person", will remain somewhat ambiguous to a person and a cognitive NLP algorithm alike without additional information.</li>
<li>Assign relative measures of meaning to a word, phrase, sentence or piece of text based on the information presented before and after the piece of text being analyzed, e.g., by means of a <a href="/facts/Probabilistic_context-free_grammar/84Ps7P9j">probabilistic context-free grammar</a> (PCFG). The mathematical equation for such algorithms is presented in <a href="https://worldwide.espacenet.com/patent/search/family/055314712/publication/US9269353B1?q=pn%3DUS9269353">US Patent 9269353</a>:<a class="footnote-ref" id="fnref:53" href="#fn:53">53</a></li></ol>

R
          M
          M
          (
          t
          o
          k
          e
          
            n
            
              N
            
          
          )
        
        =
        
          P
          M
          M
          (
          t
          o
          k
          e
          
            n
            
              N
            
          
          )
        
        ×
        
          
            1
            
              2
              d
            
          
        
        
          (
          
            
              ∑
              
                i
                =
                −
                d
              
              
                d
              
            
            
              (
              (
              P
              M
              M
              (
              t
              o
              k
              e
              
                n
                
                  N
                
              
              )
            
            ×
            
              P
              F
              (
              t
              o
              k
              e
              
                n
                
                  N
                  −
                  i
                
              
              ,
              t
              o
              k
              e
              
                n
                
                  N
                
              
              ,
              t
              o
              k
              e
              
                n
                
                  N
                  +
                  i
                
              
              )
              
                )
                
                  i
                
              
            
          
          )
        
      
    
    {\displaystyle {RMM(token_{N})}={PMM(token_{N})}\times {\frac {1}{2d}}\left(\sum _{i=-d}^{d}{((PMM(token_{N})}\times {PF(token_{N-i},token_{N},token_{N+i}))_{i}}\right)}

Where
RMM is the relative measure of meaning
token is any block of text, sentence, phrase or word
N is the number of tokens being analyzed
PMM is the probable measure of meaning based on a corpora
d is the non zero location of the token along the sequence of N tokens
PF is the probability function specific to a language
Ties with cognitive linguistics are part of the historical heritage of NLP, but they have been less frequently addressed since the statistical turn during the 1990s. Nevertheless, approaches to develop cognitive models towards technically operationalizable frameworks have been pursued in the context of various frameworks, e.g., of cognitive grammar,<a class="footnote-ref" id="fnref:54" href="#fn:54">54</a> functional grammar,<a class="footnote-ref" id="fnref:55" href="#fn:55">55</a> construction grammar,<a class="footnote-ref" id="fnref:56" href="#fn:56">56</a> computational psycholinguistics and cognitive neuroscience (e.g., <a href="/facts/ACT-R/QA8cYaAr">ACT-R</a>), however, with limited uptake in mainstream NLP (as measured by presence on major conferences<a class="footnote-ref" id="fnref:57" href="#fn:57">57</a> of the <a href="/facts/Association_for_Computational_Linguistics/0bE3QCge">ACL</a>). More recently, ideas of cognitive NLP have been revived as an approach to achieve <a href="/facts/Explainable_artificial_intelligence/dS566nb2">explainability</a>, e.g., under the notion of "cognitive AI".<a class="footnote-ref" id="fnref:58" href="#fn:58">58</a> Likewise, ideas of cognitive NLP are inherent to neural models <a href="/facts/Multimodal_interaction/VFGkgJxm">multimodal</a> NLP (although rarely made explicit)<a class="footnote-ref" id="fnref:59" href="#fn:59">59</a> and developments in <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>, specifically tools and technologies using <a href="/facts/Large_language_model/WnogWVJY">large language model</a> approaches<a class="footnote-ref" id="fnref:60" href="#fn:60">60</a> and new directions in <a href="/facts/Artificial_general_intelligence/vbxwaq8t">artificial general intelligence</a> based on the <a href="/facts/Free_energy_principle/Qgdkg134">free energy principle</a><a class="footnote-ref" id="fnref:61" href="#fn:61">61</a> by British neuroscientist and theoretician at University College London <a href="/facts/Karl_J._Friston/lmbNCNtP">Karl J. Friston</a>.

<h2 id="see-also">See also</h2>

<ul><li><a href="/facts/1_the_Road/LTDa39gg">1 the Road</a></li>
<li><a href="/facts/Artificial_intelligence_detection_software/YVpMlHHU">Artificial intelligence detection software</a></li>
<li><a href="/facts/Automated_essay_scoring/2Tm4EJtF">Automated essay scoring</a></li>
<li><a href="/facts/Biomedical_text_mining/2QUN8t6l">Biomedical text mining</a></li>
<li><a href="/facts/Compound_term_processing/AssJecnj">Compound term processing</a></li>
<li><a href="/facts/Computational_linguistics/XmegJ6LC">Computational linguistics</a></li>
<li><a href="/facts/Computer-assisted_reviewing/wUL192E0">Computer-assisted reviewing</a></li>
<li><a href="/facts/Controlled_natural_language/wtsYcSl7">Controlled natural language</a></li>
<li><a href="/facts/Deep_learning/JLuwD3ea">Deep learning</a></li>
<li><a href="/facts/Deep_linguistic_processing/cJVQzT8S">Deep linguistic processing</a></li>
<li><a href="/facts/Distributional_semantics/klV0l6o7">Distributional semantics</a></li>
<li><a href="/facts/Foreign_language_reading_aid/Hm30fEyI">Foreign language reading aid</a></li>
<li><a href="/facts/Foreign_language_writing_aid/Hb1aQIPt">Foreign language writing aid</a></li>
<li><a href="/facts/Information_extraction/DL9nMD2X">Information extraction</a></li>
<li><a href="/facts/Information_retrieval/MFSmpeNw">Information retrieval</a></li>
<li><a href="/facts/Language_and_Communication_Technologies/4fobhR5r">Language and Communication Technologies</a></li>
<li><a href="/facts/Language_model/FntSpg0j">Language model</a></li>
<li><a href="/facts/Language_technology/5gXDeyQh">Language technology</a></li>
<li><a href="/facts/Latent_semantic_indexing/IugrMyMl">Latent semantic indexing</a></li>
<li><a href="/facts/Multi-agent_system/A85vt3UA">Multi-agent system</a></li>
<li><a href="/facts/Native-language_identification/sy2zF83p">Native-language identification</a></li>
<li><a href="/facts/Natural-language_programming/u756D2Bz">Natural-language programming</a></li>
<li><a href="/facts/Natural-language_understanding/5waCJC1e">Natural-language understanding</a></li>
<li><a href="/facts/Natural-language_user_interface/TSsXHy2V">Natural-language search</a></li>
<li><a href="/facts/Outline_of_natural_language_processing/khDfKqeY">Outline of natural language processing</a></li>
<li><a href="/facts/Query_expansion/poSUBUTD">Query expansion</a></li>
<li><a href="/facts/Query_understanding/FlYc0Foe">Query understanding</a></li>
<li><a href="/facts/Reification_(linguistics)/HTSd64xk">Reification (linguistics)</a></li>
<li><a href="/facts/Speech_processing/jUjXoYwc">Speech processing</a></li>
<li><a href="/facts/Spoken_dialogue_systems/p3ED3ss8">Spoken dialogue systems</a></li>
<li><a href="/facts/Text-proofing/5gTPjRUr">Text-proofing</a></li>
<li><a href="/facts/Text_simplification/R9hqsPMM">Text simplification</a></li>
<li><a href="/facts/Transformer_(machine_learning_model)/cDbjx6a8">Transformer (machine learning model)</a></li>
<li><a href="/facts/Truecasing/YlYzRjyW">Truecasing</a></li>
<li><a href="/facts/Question_answering/1gplmc6L">Question answering</a></li>
<li><a href="/facts/Word2vec/DAuubBYX">Word2vec</a></li></ul>

<h2 id="further-reading">Further reading</h2>

<ul><li>Bates, M (1995). <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC40721">"Models of natural language understanding"</a>. Proceedings of the National Academy of Sciences of the United States of America. 92 (22): 9977–9982. <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/1995PNAS...92.9977B">1995PNAS...92.9977B</a>. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1073%2Fpnas.92.22.9977">10.1073/pnas.92.22.9977</a>. <a href="/facts/PMC_(identifier)/dX1zMt71">PMC</a> <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC40721">40721</a>. <a href="/facts/PMID_(identifier)/JlHAvMHt">PMID</a> <a href="https://pubmed.ncbi.nlm.nih.gov/7479812">7479812</a>.</li>
<li>Steven Bird, Ewan Klein, and Edward Loper (2009). Natural Language Processing with Python. O'Reilly Media. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-596-51649-9.</li>
<li>Kenna Hughes-Castleberry, "A Murder Mystery Puzzle: The literary puzzle <a href="/facts/Cain%2527s_Jawbone/HEjnr5bD">Cain's Jawbone</a>, which has stumped humans for decades, reveals the limitations of natural-language-processing algorithms", <a href="/facts/Scientific_American/jkl8bhUN">Scientific American</a>, vol. 329, no. 4 (November 2023), pp. 81–82. "This murder mystery competition has revealed that although NLP (<a href="/facts/Natural-language_processing/1hjMKsSN">natural-language processing</a>) models are capable of incredible feats, their abilities are very much limited by the amount of <a href="/facts/Context_(linguistics)/eJM44o7x">context</a> they receive. This [...] could cause [difficulties] for researchers who hope to use them to do things such as analyze <a href="/facts/Ancient_language/2E5roKIx">ancient languages</a>. In some cases, there are few historical records on long-gone <a href="/facts/Civilization/xvGpjDPj">civilizations</a> to serve as <a href="/facts/Training_data/V3mMQb2G">training data</a> for such a purpose." (p. 82.)</li>
<li>Daniel Jurafsky and James H. Martin (2008). Speech and Language Processing, 2nd edition. Pearson Prentice Hall. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-13-187321-6.</li>
<li>Mohamed Zakaria Kurdi (2016). Natural Language Processing and Computational Linguistics: speech, morphology, and syntax, Volume 1. ISTE-Wiley. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1848218482.</li>
<li>Mohamed Zakaria Kurdi (2017). Natural Language Processing and Computational Linguistics: semantics, discourse, and applications, Volume 2. ISTE-Wiley. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1848219212.</li>
<li>Christopher D. Manning, Prabhakar Raghavan, and Hinrich Schütze (2008). Introduction to Information Retrieval. Cambridge University Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-521-86571-5. <a href="http://nlp.stanford.edu/IR-book/">Official html and pdf versions available without charge.</a></li>
<li>Christopher D. Manning and Hinrich Schütze (1999). Foundations of Statistical Natural Language Processing. The MIT Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-262-13360-9.</li>
<li>David M. W. Powers and Christopher C. R. Turk (1989). Machine Learning of Natural Language. Springer-Verlag. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-387-19557-5.</li></ul>

<h2 id="external-links">External links</h2>
<ul><li> Media related to Natural language processing at Wikimedia Commons</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">"NLP". <a href="https://cs.stanford.edu/people/eroberts/courses/soco/projects/2004-05/nlp/overview_history.html" target="_blank">https://cs.stanford.edu/people/eroberts/courses/soco/projects/2004-05/nlp/overview_history.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Hutchins, J. (2005). "The history of machine translation in a nutshell" (PDF).[self-published source] <a href="http://www.hutchinsweb.me.uk/Nutshell-2005.pdf" target="_blank">http://www.hutchinsweb.me.uk/Nutshell-2005.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">"ALPAC: the (in)famous report", John Hutchins, MT News International, no. 14, June 1996, pp. 9–12. <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Crevier 1993, pp. 146–148 harvnb error: no target: CITEREFCrevier1993 (help), see also Buchanan 2005, p. 56 harvnb error: no target: CITEREFBuchanan2005 (help): "Early programs were necessarily limited in scope by the size and speed of memory" <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Koskenniemi, Kimmo (1983), Two-level morphology: A general computational model of word-form recognition and production (PDF), Department of General Linguistics, University of Helsinki <a href="/wiki/Kimmo_Koskenniemi" target="_blank">/wiki/Kimmo_Koskenniemi</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Joshi, A. K., & Weinstein, S. (1981, August). Control of Inference: Role of Some Aspects of Discourse Structure-Centering. In IJCAI (pp. 385–387). <a href="https://www.ijcai.org/Proceedings/81-1/Papers/071.pdf" target="_blank">https://www.ijcai.org/Proceedings/81-1/Papers/071.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Guida, G.; Mauri, G. (July 1986). "Evaluation of natural language processing systems: Issues and approaches". Proceedings of the IEEE. 74 (7): 1026–1035. doi:10.1109/PROC.1986.13580. ISSN 1558-2256. S2CID 30688575. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Chomskyan linguistics encourages the investigation of "corner cases" that stress the limits of its theoretical models (comparable to pathological phenomena in mathematics), typically created using thought experiments, rather than the systematic investigation of typical phenomena that occur in real-world data, as is the case in corpus linguistics. The creation and use of such corpora of real-world data is a fundamental part of machine-learning algorithms for natural language processing. In addition, theoretical underpinnings of Chomskyan linguistics such as the so-called "poverty of the stimulus" argument entail that general learning algorithms, as are typically used in machine learning, cannot be successful in language processing. As a result, the Chomskyan paradigm discouraged the application of such models to language processing. <a href="/wiki/Corner_case" target="_blank">/wiki/Corner_case</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Bengio, Yoshua; Ducharme, Réjean; Vincent, Pascal; Janvin, Christian (March 1, 2003). "A neural probabilistic language model". The Journal of Machine Learning Research. 3: 1137–1155 – via ACM Digital Library. <a href="https://dl.acm.org/doi/10.5555/944919.944966" target="_blank">https://dl.acm.org/doi/10.5555/944919.944966</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Mikolov, Tomáš; Karafiát, Martin; Burget, Lukáš; Černocký, Jan; Khudanpur, Sanjeev (26 September 2010). "Recurrent neural network based language model" (PDF). Interspeech 2010. pp. 1045–1048. doi:10.21437/Interspeech.2010-343. S2CID 17048224. {{cite book}}: |journal= ignored (help) <a href="https://gwern.net/doc/ai/nn/rnn/2010-mikolov.pdf" target="_blank">https://gwern.net/doc/ai/nn/rnn/2010-mikolov.pdf</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Goldberg, Yoav (2016). "A Primer on Neural Network Models for Natural Language Processing". Journal of Artificial Intelligence Research. 57: 345–420. arXiv:1807.10854. doi:10.1613/jair.4992. S2CID 8273530. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Goodfellow, Ian; Bengio, Yoshua; Courville, Aaron (2016). Deep Learning. MIT Press. <a href="http://www.deeplearningbook.org/" target="_blank">http://www.deeplearningbook.org/</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Jozefowicz, Rafal; Vinyals, Oriol; Schuster, Mike; Shazeer, Noam; Wu, Yonghui (2016). Exploring the Limits of Language Modeling. arXiv:1602.02410. Bibcode:2016arXiv160202410J. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Choe, Do Kook; Charniak, Eugene. "Parsing as Language Modeling". Emnlp 2016. Archived from the original on 2018-10-23. Retrieved 2018-10-22. <a href="https://web.archive.org/web/20181023034804/https://aclanthology.coli.uni-saarland.de/papers/D16-1257/d16-1257" target="_blank">https://web.archive.org/web/20181023034804/https://aclanthology.coli.uni-saarland.de/papers/D16-1257/d16-1257</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Vinyals, Oriol; et al. (2014). "Grammar as a Foreign Language" (PDF). Nips2015. arXiv:1412.7449. Bibcode:2014arXiv1412.7449V. <a href="https://papers.nips.cc/paper/5635-grammar-as-a-foreign-language.pdf" target="_blank">https://papers.nips.cc/paper/5635-grammar-as-a-foreign-language.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Turchin, Alexander; Florez Builes, Luisa F. (2021-03-19). "Using Natural Language Processing to Measure and Improve Quality of Diabetes Care: A Systematic Review". Journal of Diabetes Science and Technology. 15 (3): 553–560. doi:10.1177/19322968211000831. ISSN 1932-2968. PMC 8120048. PMID 33736486. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8120048" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8120048</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Lee, Jennifer; Yang, Samuel; Holland-Hall, Cynthia; Sezgin, Emre; Gill, Manjot; Linwood, Simon; Huang, Yungui; Hoffman, Jeffrey (2022-06-10). "Prevalence of Sensitive Terms in Clinical Notes Using Natural Language Processing Techniques: Observational Study". JMIR Medical Informatics. 10 (6): e38482. doi:10.2196/38482. ISSN 2291-9694. PMC 9233261. PMID 35687381. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9233261" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9233261</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Winograd, Terry (1971). Procedures as a Representation for Data in a Computer Program for Understanding Natural Language (Thesis). <a href="http://hci.stanford.edu/winograd/shrdlu/" target="_blank">http://hci.stanford.edu/winograd/shrdlu/</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Schank, Roger C.; Abelson, Robert P. (1977). Scripts, Plans, Goals, and Understanding: An Inquiry Into Human Knowledge Structures. Hillsdale: Erlbaum. ISBN 0-470-99033-3. <a href="0-470-99033-3" target="_blank">0-470-99033-3</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">Mark Johnson. How the statistical revolution changes (computational) linguistics. Proceedings of the EACL 2009 Workshop on the Interaction between Linguistics and Computational Linguistics. <a href="http://www.aclweb.org/anthology/W09-0103" target="_blank">http://www.aclweb.org/anthology/W09-0103</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Philip Resnik. Four revolutions. Language Log, February 5, 2011. <a href="http://languagelog.ldc.upenn.edu/nll/?p=2946" target="_blank">http://languagelog.ldc.upenn.edu/nll/?p=2946</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Socher, Richard. "Deep Learning For NLP-ACL 2012 Tutorial". www.socher.org. Retrieved 2020-08-17. This was an early Deep Learning tutorial at the ACL 2012 and met with both interest and (at the time) skepticism by most participants. Until then, neural learning was basically rejected because of its lack of statistical interpretability. Until 2015, deep learning had evolved into the major framework of NLP. [Link is broken, try http://web.stanford.edu/class/cs224n/] <a href="https://www.socher.org/index.php/Main/DeepLearningForNLP-ACL2012Tutorial" target="_blank">https://www.socher.org/index.php/Main/DeepLearningForNLP-ACL2012Tutorial</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Segev, Elad (2022). Semantic Network Analysis in Social Sciences. London: Routledge. ISBN 9780367636524. Archived from the original on 5 December 2021. Retrieved 5 December 2021. <a href="9780367636524" target="_blank">9780367636524</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Yi, Chucai; Tian, Yingli (2012), "Assistive Text Reading from Complex Background for Blind Persons", Camera-Based Document Analysis and Recognition, Lecture Notes in Computer Science, vol. 7139, Springer Berlin Heidelberg, pp. 15–28, CiteSeerX 10.1.1.668.869, doi:10.1007/978-3-642-29364-1_2, ISBN 9783642293634 <a href="9783642293634" target="_blank">9783642293634</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">"Natural Language Processing (NLP) - A Complete Guide". www.deeplearning.ai. 2023-01-11. Retrieved 2024-05-05. <a href="https://www.deeplearning.ai/resources/natural-language-processing/" target="_blank">https://www.deeplearning.ai/resources/natural-language-processing/</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">"What is Natural Language Processing? Intro to NLP in Machine Learning". GyanSetu!. 2020-12-06. Retrieved 2021-01-09. <a href="https://www.gyansetu.in/what-is-natural-language-processing/" target="_blank">https://www.gyansetu.in/what-is-natural-language-processing/</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">Kishorjit, N.; Vidya, Raj RK.; Nirmal, Y.; Sivaji, B. (2012). "Manipuri Morpheme Identification" (PDF). Proceedings of the 3rd Workshop on South and Southeast Asian Natural Language Processing (SANLP). COLING 2012, Mumbai, December 2012: 95–108.{{cite journal}}: CS1 maint: location (link) <a href="http://aclweb.org/anthology//W/W12/W12-5008.pdf" target="_blank">http://aclweb.org/anthology//W/W12/W12-5008.pdf</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">Klein, Dan; Manning, Christopher D. (2002). "Natural language grammar induction using a constituent-context model" (PDF). Advances in Neural Information Processing Systems. <a href="http://papers.nips.cc/paper/1945-natural-language-grammar-induction-using-a-constituent-context-model.pdf" target="_blank">http://papers.nips.cc/paper/1945-natural-language-grammar-induction-using-a-constituent-context-model.pdf</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">Kariampuzha, William; Alyea, Gioconda; Qu, Sue; Sanjak, Jaleal; Mathé, Ewy; Sid, Eric; Chatelaine, Haley; Yadaw, Arjun; Xu, Yanji; Zhu, Qian (2023). "Precision information extraction for rare disease epidemiology at scale". Journal of Translational Medicine. 21 (1): 157. doi:10.1186/s12967-023-04011-y. PMC 9972634. PMID 36855134. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9972634" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9972634</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">"Natural Language Processing (NLP) - A Complete Guide". www.deeplearning.ai. 2023-01-11. Retrieved 2024-05-05. <a href="https://www.deeplearning.ai/resources/natural-language-processing/" target="_blank">https://www.deeplearning.ai/resources/natural-language-processing/</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">PASCAL Recognizing Textual Entailment Challenge (RTE-7) https://tac.nist.gov//2011/RTE/ <a href="https://tac.nist.gov//2011/RTE/" target="_blank">https://tac.nist.gov//2011/RTE/</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
<li id="fn:32">Lippi, Marco; Torroni, Paolo (2016-04-20). "Argumentation Mining: State of the Art and Emerging Trends". ACM Transactions on Internet Technology. 16 (2): 1–25. doi:10.1145/2850417. hdl:11585/523460. ISSN 1533-5399. S2CID 9561587. <a href="https://dl.acm.org/doi/10.1145/2850417" target="_blank">https://dl.acm.org/doi/10.1145/2850417</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></li>
<li id="fn:33">"Argument Mining – IJCAI2016 Tutorial". www.i3s.unice.fr. Retrieved 2021-03-09. <a href="https://www.i3s.unice.fr/~villata/tutorialIJCAI2016.html" target="_blank">https://www.i3s.unice.fr/~villata/tutorialIJCAI2016.html</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></li>
<li id="fn:34">"NLP Approaches to Computational Argumentation – ACL 2016, Berlin". Retrieved 2021-03-09. <a href="http://acl2016tutorial.arg.tech/" target="_blank">http://acl2016tutorial.arg.tech/</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></li>
<li id="fn:35">Administration. "Centre for Language Technology (CLT)". Macquarie University. Retrieved 2021-01-11. <a href="https://www.mq.edu.au/research/research-centres-groups-and-facilities/innovative-technologies/centres/centre-for-language-technology-clt" target="_blank">https://www.mq.edu.au/research/research-centres-groups-and-facilities/innovative-technologies/centres/centre-for-language-technology-clt</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></li>
<li id="fn:36">"Shared Task: Grammatical Error Correction". www.comp.nus.edu.sg. Retrieved 2021-01-11. <a href="https://www.comp.nus.edu.sg/~nlp/conll13st.html" target="_blank">https://www.comp.nus.edu.sg/~nlp/conll13st.html</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></li>
<li id="fn:37">"Shared Task: Grammatical Error Correction". www.comp.nus.edu.sg. Retrieved 2021-01-11. <a href="https://www.comp.nus.edu.sg/~nlp/conll14st.html" target="_blank">https://www.comp.nus.edu.sg/~nlp/conll14st.html</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></li>
<li id="fn:38">Duan, Yucong; Cruz, Christophe (2011). "Formalizing Semantic of Natural Language through Conceptualization from Existence". International Journal of Innovation, Management and Technology. 2 (1): 37–42. Archived from the original on 2011-10-09. <a href="https://web.archive.org/web/20111009135952/http://www.ijimt.org/abstract/100-E00187.htm" target="_blank">https://web.archive.org/web/20111009135952/http://www.ijimt.org/abstract/100-E00187.htm</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></li>
<li id="fn:39">"U B U W E B :: Racter". www.ubu.com. Retrieved 2020-08-17. <a href="http://www.ubu.com/historical/racter/index.html" target="_blank">http://www.ubu.com/historical/racter/index.html</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></li>
<li id="fn:40">Writer, Beta (2019). Lithium-Ion Batteries. doi:10.1007/978-3-030-16800-1. ISBN 978-3-030-16799-8. S2CID 155818532. <a href="978-3-030-16799-8" target="_blank">978-3-030-16799-8</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></li>
<li id="fn:41">"Document Understanding AI on Google Cloud (Cloud Next '19) – YouTube". www.youtube.com. 11 April 2019. Archived from the original on 2021-10-30. Retrieved 2021-01-11. <a href="https://ghostarchive.org/varchive/youtube/20211030/7dtl650D0y0" target="_blank">https://ghostarchive.org/varchive/youtube/20211030/7dtl650D0y0</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></li>
<li id="fn:42">Robertson, Adi (2022-04-06). "OpenAI's DALL-E AI image generator can now edit pictures, too". The Verge. Retrieved 2022-06-07. <a href="https://www.theverge.com/2022/4/6/23012123/openai-clip-dalle-2-ai-text-to-image-generator-testing" target="_blank">https://www.theverge.com/2022/4/6/23012123/openai-clip-dalle-2-ai-text-to-image-generator-testing</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></li>
<li id="fn:43">"The Stanford Natural Language Processing Group". nlp.stanford.edu. Retrieved 2022-06-07. <a href="https://nlp.stanford.edu/projects/text2scene.shtml" target="_blank">https://nlp.stanford.edu/projects/text2scene.shtml</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></li>
<li id="fn:44">Coyne, Bob; Sproat, Richard (2001-08-01). "WordsEye". Proceedings of the 28th annual conference on Computer graphics and interactive techniques. SIGGRAPH '01. New York, NY, USA: Association for Computing Machinery. pp. 487–496. doi:10.1145/383259.383316. ISBN 978-1-58113-374-5. S2CID 3842372. <a href="978-1-58113-374-5" target="_blank">978-1-58113-374-5</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></li>
<li id="fn:45">"Google announces AI advances in text-to-video, language translation, more". VentureBeat. 2022-11-02. Retrieved 2022-11-09. <a href="https://venturebeat.com/ai/google-announces-ai-advances-in-text-to-video-language-translation-more/" target="_blank">https://venturebeat.com/ai/google-announces-ai-advances-in-text-to-video-language-translation-more/</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></li>
<li id="fn:46">Vincent, James (2022-09-29). "Meta's new text-to-video AI generator is like DALL-E for video". The Verge. Retrieved 2022-11-09. <a href="https://www.theverge.com/2022/9/29/23378210/meta-text-to-video-ai-generation-make-a-video-model-dall-e" target="_blank">https://www.theverge.com/2022/9/29/23378210/meta-text-to-video-ai-generation-make-a-video-model-dall-e</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></li>
<li id="fn:47">"Previous shared tasks | CoNLL". www.conll.org. Retrieved 2021-01-11. <a href="https://www.conll.org/previous-tasks" target="_blank">https://www.conll.org/previous-tasks</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></li>
<li id="fn:48">"Cognition". Lexico. Oxford University Press and Dictionary.com. Archived from the original on July 15, 2020. Retrieved 6 May 2020. <a href="https://web.archive.org/web/20200715113427/https://www.lexico.com/definition/cognition" target="_blank">https://web.archive.org/web/20200715113427/https://www.lexico.com/definition/cognition</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></li>
<li id="fn:49">"Ask the Cognitive Scientist". American Federation of Teachers. 8 August 2014. Cognitive science is an interdisciplinary field of researchers from Linguistics, psychology, neuroscience, philosophy, computer science, and anthropology that seek to understand the mind. <a href="http://www.aft.org/newspubs/periodicals/ae/summer2002/willingham.cfm" target="_blank">http://www.aft.org/newspubs/periodicals/ae/summer2002/willingham.cfm</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></li>
<li id="fn:50">Robinson, Peter (2008). Handbook of Cognitive Linguistics and Second Language Acquisition. Routledge. pp. 3–8. ISBN 978-0-805-85352-0. <a href="978-0-805-85352-0" target="_blank">978-0-805-85352-0</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></li>
<li id="fn:51">Lakoff, George (1999). Philosophy in the Flesh: The Embodied Mind and Its Challenge to Western Philosophy; Appendix: The Neural Theory of Language Paradigm. New York Basic Books. pp. 569–583. ISBN 978-0-465-05674-3. <a href="978-0-465-05674-3" target="_blank">978-0-465-05674-3</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></li>
<li id="fn:52">Strauss, Claudia (1999). A Cognitive Theory of Cultural Meaning. Cambridge University Press. pp. 156–164. ISBN 978-0-521-59541-4. <a href="978-0-521-59541-4" target="_blank">978-0-521-59541-4</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></li>
<li id="fn:53">US patent 9269353
 <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US9269353" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US9269353</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></li>
<li id="fn:54">"Universal Conceptual Cognitive Annotation (UCCA)". Universal Conceptual Cognitive Annotation (UCCA). Retrieved 2021-01-11. <a href="https://universalconceptualcognitiveannotation.github.io/" target="_blank">https://universalconceptualcognitiveannotation.github.io/</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></li>
<li id="fn:55">Rodríguez, F. C., & Mairal-Usón, R. (2016). Building an RRG computational grammar. Onomazein, (34), 86–117. <a href="https://www.redalyc.org/pdf/1345/134549291020.pdf" target="_blank">https://www.redalyc.org/pdf/1345/134549291020.pdf</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></li>
<li id="fn:56">"Fluid Construction Grammar – A fully operational processing system for construction grammars". Retrieved 2021-01-11. <a href="https://www.fcg-net.org/" target="_blank">https://www.fcg-net.org/</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></li>
<li id="fn:57">"ACL Member Portal | The Association for Computational Linguistics Member Portal". www.aclweb.org. Retrieved 2021-01-11. <a href="https://www.aclweb.org/portal/" target="_blank">https://www.aclweb.org/portal/</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></li>
<li id="fn:58">"Chunks and Rules". W3C. Retrieved 2021-01-11. <a href="https://www.w3.org/Data/demos/chunks/chunks.html" target="_blank">https://www.w3.org/Data/demos/chunks/chunks.html</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></li>
<li id="fn:59">Socher, Richard; Karpathy, Andrej; Le, Quoc V.; Manning, Christopher D.; Ng, Andrew Y. (2014). "Grounded Compositional Semantics for Finding and Describing Images with Sentences". Transactions of the Association for Computational Linguistics. 2: 207–218. doi:10.1162/tacl_a_00177. S2CID 2317858. <a href="https://doi.org/10.1162%2Ftacl_a_00177" target="_blank">https://doi.org/10.1162%2Ftacl_a_00177</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></li>
<li id="fn:60">Dasgupta, Ishita; Lampinen, Andrew K.; Chan, Stephanie C. Y.; Creswell, Antonia; Kumaran, Dharshan; McClelland, James L.; Hill, Felix (2022). "Language models show human-like content effects on reasoning, Dasgupta, Lampinen et al". arXiv:2207.07051 [cs.CL]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></li>
<li id="fn:61">Friston, Karl J. (2022). Active Inference: The Free Energy Principle in Mind, Brain, and Behavior; Chapter 4 The Generative Models of Active Inference. The MIT Press. ISBN 978-0-262-36997-8. <a href="978-0-262-36997-8" target="_blank">978-0-262-36997-8</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></li>
</ol>

Natural language processing open-in-new

Natural language processing