|
Morphotactics
Morphotactics represent the ordering restrictions in place on the ordering of morphemes. Etymologically, it can be translated as "the set of rules that define how morphemes (morpho) can touch (tactics) each other". Example of a morphotactic rule Many English affixes may only be attached directly to morphemes with particular parts of speech: * '' do'' + ''-able'' + '' -ity'' = '' doability'' but not * '' do'' + '' -ity'' + ''-able'' = *''doityable'' The suffix '' -ity'' produces a noun from an adjective, and ''-able'' creates adjectives from verbs.{{Cite web, url=http://www-rohan.sdsu.edu/~gawron/compling/week3/morph.htm, title = Computational Linguistics To reverse the order violates the rules of English morphotactics, making the word ungrammatical (marked with an asterisk). Common morphotactic model Finite-state machine and Graph are the two models which are often used as a set of rules for morphotactics. References * ''Morphology and Computation,'' By Richard William Sproat. MI ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morphemes
A morpheme is the smallest meaningful constituent of a linguistic expression. The field of linguistic study dedicated to morphemes is called morphology. In English, morphemes are often but not necessarily words. Morphemes that stand alone are considered roots (such as the morpheme ''cat''); other morphemes, called affixes, are found only in combination with other morphemes. For example, the ''-s'' in ''cats'' indicates the concept of plurality but is always bound to another concept to indicate a specific kind of plurality. This distinction is not universal and does not apply to, for example, Latin, in which many roots cannot stand alone. For instance, the Latin root ''reg-'' (‘king’) must always be suffixed with a case marker: ''rex'' (''reg-s''), ''reg-is'', ''reg-i'', etc. For a language like Latin, a root can be defined as the main lexical morpheme of a word. These sample English words have the following morphological analyses: * "Unbreakable" is composed of three m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affix
In linguistics, an affix is a morpheme that is attached to a word stem to form a new word or word form. Affixes may be derivational, like English ''-ness'' and ''pre-'', or inflectional, like English plural ''-s'' and past tense ''-ed''. They are bound morphemes by definition; prefixes and suffixes may be separable affixes. Affixation is the linguistic process that speakers use to form different words by adding morphemes at the beginning (prefixation), the middle (infixation) or the end (suffixation) of words. Positional categories of affixes ''Prefix'' and ''suffix'' may be subsumed under the term ''adfix'', in contrast to ''infix.'' When marking text for interlinear glossing, as in the third column in the chart above, simple affixes such as prefixes and suffixes are separated from the stem with hyphens. Affixes which disrupt the stem, or which themselves are discontinuous, are often marked off with angle brackets. Reduplication is often shown with a tilde. Affixes which c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Part Of Speech
In grammar, a part of speech or part-of-speech (abbreviated as POS or PoS, also known as word class or grammatical category) is a category of words (or, more generally, of lexical items) that have similar grammatical properties. Words that are assigned to the same part of speech generally display similar syntactic behavior (they play similar roles within the grammatical structure of sentences), sometimes similar morphological behavior in that they undergo inflection for similar properties and even similar semantic behavior. Commonly listed English parts of speech are noun, verb, adjective, adverb, pronoun, preposition, conjunction, interjection, numeral, article, and determiner. Other terms than ''part of speech''—particularly in modern linguistic classifications, which often make more precise distinctions than the traditional scheme does—include word class, lexical class, and lexical category. Some authors restrict the term ''lexical category'' to refer only to a particular ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
-able
In linguistics, a suffix is an affix which is placed after the stem of a word. Common examples are case endings, which indicate the grammatical case of nouns, adjectives, and verb endings, which form the conjugation of verbs. Suffixes can carry grammatical information (inflectional suffixes) or lexical information ( derivational/lexical suffixes'').'' An inflectional suffix or a grammatical suffix. Such inflection changes the grammatical properties of a word within its syntactic category. For derivational suffixes, they can be divided into two categories: class-changing derivation and class-maintaining derivation. Particularly in the study of Semitic languages, suffixes are called affirmatives, as they can alter the form of the words. In Indo-European studies, a distinction is made between suffixes and endings (see Proto-Indo-European root). Suffixes can carry grammatical information or lexical information. A word-final segment that is somewhere between a free morpheme and a boun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjectives
In linguistics, an adjective (abbreviated ) is a word that generally modifies a noun or noun phrase or describes its referent. Its semantic role is to change information given by the noun. Traditionally, adjectives were considered one of the main parts of speech of the English language, although historically they were classed together with nouns. Nowadays, certain words that usually had been classified as adjectives, including ''the'', ''this'', ''my'', etc., typically are classed separately, as determiners. Here are some examples: * That's a funny idea. (attributive) * That idea is funny. ( predicative) * * The good, the bad, and the funny. ( substantive) Etymology ''Adjective'' comes from Latin ', a calque of grc, ἐπίθετον ὄνομα, epítheton ónoma, additional noun (whence also English '' epithet''). In the grammatical tradition of Latin and Greek, because adjectives were inflected for gender, number, and case like nouns (a process called declension), they we ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grammaticality
In linguistics, grammaticality is determined by the conformity to language usage as derived by the grammar of a particular speech variety. The notion of grammaticality rose alongside the theory of generative grammar, the goal of which is to formulate rules that define well-formed, grammatical, sentences. These rules of grammaticality also provide explanations of ill-formed, ungrammatical sentences. In theoretical linguistics, a speaker's judgement on the well-formedness of a linguistic 'string'—called a grammaticality judgement—is based on whether the sentence is interpreted in accordance with the rules and constraints of the relevant grammar. If the rules and constraints of the particular lect are followed, then the sentence is judged to be grammatical. In contrast, an ungrammatical sentence is one that violates the rules of the given language variety. Linguists use grammaticality judgements to investigate the syntactic structure of sentences. Generative linguists are la ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Asterisk
The asterisk ( ), from Late Latin , from Ancient Greek , ''asteriskos'', "little star", is a typographical symbol. It is so called because it resembles a conventional image of a heraldic star. Computer scientists and mathematicians often vocalize it as star (as, for example, in ''the A* search algorithm'' or ''C*-algebra''). In English, an asterisk is usually five- or six-pointed in sans-serif typefaces, six-pointed in serif typefaces, and six- or eight-pointed when handwritten. Its most common use is to call out a footnote. It is also often used to censor offensive words. In computer science, the asterisk is commonly used as a wildcard character, or to denote pointers, repetition, or multiplication. History The asterisk has already been used as a symbol in ice age cave paintings. There is also a two thousand-year-old character used by Aristarchus of Samothrace called the , , which he used when proofreading Homeric poetry to mark lines that were duplicated. Origen is know ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite-state Machine
A finite-state machine (FSM) or finite-state automaton (FSA, plural: ''automata''), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of '' states'' at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a ''transition''. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types— deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic one. The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions depending on a sequence of events with which they are presented. Simple examples are vending machines, which dispense p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, and more specifically in graph theory, a graph is a structure amounting to a Set (mathematics), set of objects in which some pairs of the objects are in some sense "related". The objects correspond to mathematical abstractions called ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Sproat
Richard Sproat is a computational linguist currently working for Google as a researcher on text normalization and speech recognition. Linguistics Sproat graduated from Massachusetts Institute of Technology in 1985, under the supervision of Kenneth L. Hale. His PhD thesis is one of the earliest work that derives morphosyntactically complex forms from the module which produces the phonological form that realizes these morpho-syntactic expressions, one of the core ideas in Distributed Morphology. One of Sproat's main contributions to computational linguistics is in the field of text normalization, where his work with colleagues in 2001, ''Normalization of non-standard words'', was considered a seminal work in formalizing this component of speech synthesis Speech synthesis is the artificial production of human speech. A computer system used for this purpose is called a speech synthesizer, and can be implemented in software or hardware products. A text-to-speech (TTS) system c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
