|
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 part of speech, parts of speech: * ''wikt:do#English, do'' + ''wikt:-able#English, -able'' + ''wikt:-ity#English, -ity'' = ''wikt:doability#English, doability'' but not * ''wikt:do#English, do'' + ''wikt:-ity#English, -ity'' + ''wikt:-able#English, -able'' = *''doityable'' The suffix ''wikt:-ity#English, -ity'' produces a noun from an adjective, and ''wikt:-able#English, -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 Grammaticality, ungrammatical (marked with an Asterisk#Generative li ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morphemes
A morpheme is any of the smallest meaningful constituents within a linguistic expression and particularly within a word. Many words are themselves standalone morphemes, while other words contain multiple morphemes; in linguistic terminology, this is the distinction, respectively, between free and bound morphemes. The field of linguistic study dedicated to morphemes is called morphology. In English, inside a word with multiple morphemes, the main morpheme that gives the word its basic meaning is called a root (such as ''cat'' inside the word ''cats''), which can be bound or free. Meanwhile, additional bound morphemes, called affixes, may be added before or after the root, like the ''-s'' in ''cats'', which indicates plurality but is always bound to a root noun and is not regarded as a word on its own. However, in some languages, including English and Latin, even many roots cannot stand alone; i.e., they are bound morphemes. For instance, the Latin root ''reg-'' ('king') must alwa ... [...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. The main two categories are Morphological derivation, derivational and inflectional affixes. Derivational affixes, such as ''un-'', ''-ation'', ''anti-'', ''pre-'' etc., introduce a semantic change to the word they are attached to. Inflectional affixes introduce a syntactic change, such as singular into plural (e.g. ''-(e)s''), or present simple grammatical tense, tense into present continuous or past tense by adding ''-ing'', ''-ed'' to an English word. All of them are bound morphemes by definition; prefixes and suffixes may be separable affixes. Affixes, infixes and their variations Changing a word by adding a morpheme at its beginning is called ''prefixation'', in the middle is called ''infixation'', and at the end is called ''suffixation''. ''Prefix'' and ''suffix'' may be subsumed under the term ''adfix'', in contrast to ''infix.'' When marking text for interlinear gl ... [...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 par ... [...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 and adjectives, and verb endings, which form the conjugation of verbs. Suffixes can carry grammatical information (inflectional endings) or lexical information ( derivational/lexical suffixes)''.'' Inflection changes the grammatical properties of a word within its syntactic category. Derivational suffixes fall 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). A word-final segment that is somewhere between a free morpheme and a bound morpheme is known as a suffixoidKremer, Marion. 1997. ''Person reference and gender in translation: a contrastive investigation of Engli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adjectives
An adjective (abbreviated ) is a word that describes or defines a noun or noun phrase. Its semantic role is to change information given by the noun. Traditionally, adjectives are 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. Examples: * That's a ''funny'' idea. (Prepositive attributive) * That idea is ''funny''. ( Predicative) * * The ''good'', the ''bad'', and the ''funny''. (Substantive) * Clara Oswald, completely ''fictional'', died three times. ( Appositive) Etymology ''Adjective'' comes from Latin ', a calque of (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 were considered a type ... [...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 larg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Asterisk
The asterisk ( ), from Late Latin , from Ancient Greek , , "little star", is a Typography, typographical symbol. It is so called because it resembles a conventional image of a star (heraldry), heraldic star. Computer scientists and Mathematician, mathematicians often vocalize it as star (as, for example, in ''the A* search algorithm'' or ''C*-algebra''). An asterisk is usually five- or six-pointed in printing, print and six- or eight-pointed when handwritten, though more complex forms exist. 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 pointer (computer programming), pointers, repetition, or multiplication. History The asterisk was already in use as a symbol in ice age Cave painting, cave paintings. There is also a two-thousand-year-old character used by Aristarchus of Samothrace called the , , which he used when proofreading Homeri ... [...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 ''State (computer science), states'' at any given time. The FSM can change from one state to another in response to some Input (computer science), 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 automaton, deterministic finite-state machines and Nondeterministic finite automaton, non-deterministic finite-state machines. For any non-deterministic finite-state machine, an equivalent deterministic one can be constructed. The behavior of state machines can be observed in many devices in modern society that perform a predetermined sequence of actions d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a Set (mathematics), set of objects where some pairs of the objects are in some sense "related". The objects are represented by 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. 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'' means that ''A'' owes money to ''B'', then this graph is directed, because owing mon ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Sproat
Richard Sproat is a computational linguist currently working for Sakana AI as a research scientist. Prior to joining Sakana AI, Sproat worked for Google between 2012 and 2024 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, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
