About the linguistic term Unbalanced date December 2010 In linguistics , a suffix also sometimes called a postfix or ending is an affix which is placed after the Stem linguistics stem of a word. Common examples are case endings, which indicate the grammatical case of nouns or adjectives, and verb endings, which form the grammatical conjugation conjugation of verbs. Particularly in the study of Semitic languages , a suffix is called an afformative , as they can alter the form of the words to which they are fixed. In Indo European studies , a distinction is made between suffixes and endings see Proto Indo European root . Suffixes can carry grammatical information inflection al suffixes . Derivation linguistics derivational suffixes . An inflectional suffix is sometimes called a desinence . ref http www.thefreedictionary.com desinence The Free Online Dictionary ref Some examples in europe Girl s , where the suffix s marks the plural . He make s , where suffix s marks the third person Grammatical number singular present tense . It clos ed , where the suffix ed marks the past tense . Many synthetic language s Czech language Czech , German language German , Finnish language Finnish , Latin ..., but it hasn t clear ed at all. the suffix ed inflects the root linguistics root word clear to indicate ... The weather forecaster said it would be clear today, but I can t see clearly at all the suffix ... said it would be a clear day today, but I think it s more like clearish the suffix ish modifies ... Marker linguistics Morpheme Pejorative suffix Prefix Prefix morpheme wikt suffixSuffix at Wiktionary ... Comprehensive and searchable suffix reference Category Linguistic morphology Category ... Mbiti br Lostger bg ca Sufix ceb Taponggikit cs Sufix da Suffiks de Suffix et Sufiks el ... mt Suffiss nl Suffix ja no Suffiks nn Affiks Suffiks nds Suffix pl Przyrostek pt Sufixo qu K askaq ru simple Suffix sk Pr pona fi Suffiksi sv Suffix uk vo Poy mot wa Cawete ... more details
wiktionarypar suffix Appendix Suffixes A suffix is part of a word an affix that follows the morphemes to which it can attach. Suffix may also refer to Suffix name , the style at the end of a person s name which gives additional identifying information about the person Suffix computer science , the last part of a string of characters Index notation Suffix notation mathematics , a powerful notation for manipulating vector quantities it is also known as Index notation Filename extension for computer files The last part of a radio or broadcast callsign radio callsign See also Prefix Infix Derivation linguistics Wiktionary Appendix Suffixes English List of English suffixes Unpaired word disambig cs P pona fr Suffixe uk ... more details
In computer science , a suffix array is an array data structure array of integers giving the starting positions of suffix computer science suffixes of a string computer science string in lexicographical ... class wikitable border 1 index sorted suffix lcp 12 0 11 a 0 8 abra 1 1 abracadabra 4 4 acadabra ... string is available, each suffix can be completely specified by the index of its first character. The suffix ... abracadabra , using 1 based array one based indexing, the suffix array is 12,11,8,1,4,6,9,2,5,7,10,3 , because the suffix begins at position 12, a begins at position 11, abra begins at position 8 ... of prefix indices, indicates how many characters a particular suffix has in common with the suffix ... all of those suffixes can also be useful. Algorithms The easiest way to construct a suffix array is to use an efficient comparison sort algorithm. This requires math O n log n math suffix comparisons, but a suffix comparison requires math O n math time, so the overall runtime of this approach is math ... are derived from the suffix tree construction algorithm of Farach. Recent work by Salson et al. proposes an algorithm for updating the suffix array of a text that has been edited instead of rebuilding a new suffix array from scratch. Even if the theoretical worst case time complexity is math O n log ... of dynamic suffix arrays is generally more efficient than rebuilding when comparing the insertion of 500 characters into their dynamic array with a complete rebuild of a static suffix array containing the updated text. Applications The suffix array of a string can be used as an index .... Finding every occurrence of the substring is equivalent to finding every suffix that begins with the substring. Thanks to the lexicographical ordering, these suffixes will be grouped together in the suffix ... W. The following pseudo code from Manber and Myers shows how to find W or the suffix lexicographically immediately before W if W is not present in a suffix array with indices stored in pos. pre if W ... more details
Unreferenced date December 2009 In Finland , a ry is a suffix linguistics suffix ending which generally denotes a registered, non profit organization . In this instance, ry is an abbreviation for rekister ity yhdistys , or registered association , e.g. TAAt tAAt ry . Registration requires the organization to create legally sound constitution, which must be approved by the Registry office. Registration gives the organization juristic person ality, with the right to own property independently of its members, and ensures the legal enforceability of its constitution. DEFAULTSORT Ry Suffix Category Types of companies Finland stub Nonprofit org stub ... more details
Image Suffix tree BANANA.svg thumb 250px right Suffix tree for the string code BANANA code . Each substring ... suffix. Suffix links drawn dashed. In computer science , a suffix tree also called PAT tree or, in an earlier form, position tree is a data structure that presents the suffix computer science ... of many important string operations. The suffix tree for a string math S math is a tree data structure tree whose edges are labeled with strings, such that each suffix of math S math corresponds ... if a certain number of mistakes are allowed, locating matches for a regular expression pattern etc. Suffix ... . These speedups come at a cost storing a string s suffix tree typically requires significantly ... author Edward M. McCreight title A Space Economical Suffix Tree Construction Algorithm journal Journal ... E. Ukkonen title On line construction of suffix trees journal Algorithmica volume 14 issue 3 year 1995 ... and Weiner A Unifying View of Linear Time Suffix Tree Construction journal Algorithmica volume 19 ... doi 10.1007 PL00009177 ref Ukkonen provided the first linear time online construction of suffix ... Far97 cite journal author M. Farach title Optimal Suffix Tree Construction with Large Alphabets journal ... suffix tree construction algorithm that is optimal for all alphabets. In particular, this is the first ... both suffix trees and suffix array s, for example, in external memory, compressed, succinct, etc. Definition The suffix tree for the string math S math of length math n math is defined as a tree such that ref ... code . This ensures that no suffix is a prefix of another, and that there will be math n math leaf ..., 1 root . Suffix links are a key feature for older linear time construction algorithms, although most newer algorithms, which are based on Farach s algorithm , dispense with suffix links. In a complete suffix tree, all internal non root nodes have a suffix link to another internal node. If the path ... character and math alpha math is a string possibly empty , it has a suffix link to the internal node ... more details
Unreferenced date December 2006 A street suffix is the word that follows the name of a street to further describe that street. Common American street suffixes Alley usually refers to a rear service road used as access to garages, service doors, Dumpsters, etc. Arch usually refers to a curving street, often in the shape of an arch, used similar to crescent Street name Avenue , one of the most common suffixes, can refer to a small residential street or a major roadway. Boardwalk is almost universally a pedestrian only space along an ocean or other waterfront. Boulevard usually indicates a wide street, often tree lined, that is of major importance. Bypass road Bypass is usually used after another suffix, for example Tenth Street Bypass . Circle is usually a small residential street whose shape is circular. Court is usually a residential cul de sac . Cove is similar to court, and often named after the street it connects to. Crescent is usually a short curved street. Drive is usually used in suburban areas both for residential streets and major roadways. Esplanade usually designates a pedestrian only space. Expressway is usually used for limited access highways. Extension is usually used after another suffix, for example Robinson Street Extension . Freeway is usually used for limited access highways where no toll road toll is collected. Green is usually a small residential street, often with a parklike setting. Highway can designate a limited access highway or a major US or state route. Lane is commonly used for dead end streets, usually referring to a small residential street. Loop is usually used for streets whose shape is that of a half circle. Mall usually designates a pedestrian ... roadways. Promenade usually designates a pedestrian only space. Road is a very common suffix used ... a grid of north south streets and east west avenues or vice versa . Street is a very common suffix ... definition to a residential street to a major roadway in new developments. DEFAULTSORT Street Suffix ... more details
Unreferenced date November 2009 A pejorative suffix is a suffix that attaches a negative meaning to the word or word stem preceding it. There is frequent overlap between this and the diminutive form. The pejorative suffix may add the sense of a despicable example of the preceding, as in Spanish ejo see below . It can also convey the sense of a despicable human having the preceding characteristic for instance, as in English el see below or the development of the word cuckold from Old French cocu cuckoo ald , taken into Anglo Saxon as cokewald and thus to the modern English word. Examples of the pejorative suffix Basque language Basque txo ref http www.amazon.ca Basque History World Mark Kurlansky dp 0676973663 Amazon.ca The Basque History of the World Books Mark Kurlansky Bot generated title ref Catalan language Catalan alla alles Suffixed to nouns gives new nouns. Examples gentalla from gent people . It s also used as a collective group suffix. arro arros fem. arra arres Suffixed to nouns gives new nouns. Example veuarra from veu voice . It s also used as an augmentative suffix. astre astres fem. astra astres Suffixed to nouns gives new nouns. Example poetastra from poeta poet . This suffix has also the meaning indirect relation with . ot ots fem. ota otes Suffixed to nouns gives new nouns. Example sabatot from sabata shoe . Suffixed to adjectives gives new adjectives. Example lletjot from lleig ugly . As a suffix it also means object , giving a lexicalized word. English language English ar, e.g. beggar ard, e.g. bastard from Old French bast pack saddle , i.e. child born in a pack saddle coward , drunkard . aster, e.g. poetaster , philosophaster via Latin el, e.g. wastrel from waste , i.e. a wasteful person pej. ista e.g. fashionista sometimes used as a more playful pejorative than others, likely a play on fascista which is Italian for fascist less likely taken from Sandinista nik, e.g. peacenik , neatnik via Yiddish or Russian, where it is not necessarily pejorative ... more details
distinguish2 the Saxon genitive English s possessive marker In linguistics , a possessive suffix is a suffix attached to a noun to indicate its possession linguistics possessor , much in the manner of possessive adjective s. Possessive suffixes do not exist in all languages they do exist in some Uralic languages Uralic , Altaic languages Altaic , Semitic languages Semitic , and Indo European languages . Complicated systems are found in the Uralic languages for example, Nenets languages Nenets has 27 3× 3× 3 different forms to distinguish the possessor first, second, third grammatical person person , the grammatical number number of possessors singular, dual, plural and the number of objects singular, dual, plural . This allows Nenets speakers to express the phrase many houses of us two in one word ref Nenets example . Possessive suffixes in various languages Finnish Finnish language Finnish is one language that uses possessive suffixes. The number of possessors and their person can be distinguished for the singular and plural, except for the third person. However, the construction hides the number of possessed objects when the singular objects are in nominative case nominative ... s The grammatical case s are not affected by the possessive suffix, except for the accusative case n or unmarked , which is left unmarked by anything but the possessive suffix. The third person suffix is used only if the possessor is the subject. For example, Mari maalasi talo u nsa u Mari ... case . In this case, the possessive suffix remains. For example, my house can be taloni or minun ... suffix makes it possible to distinguish the plural for the possessed objects, although this is not considered ... the possessive suffix is used Ne otti takki u nsa u . Even in proper Finnish, the pronouns sen ... person person Suffix 1st person singular am 2nd person singular at 3rd person singular a ... 2 Possessive br suffix small Ayt Ayache small small Ayt Seghrouchen small I colspan 2 IPA i nw ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Summary I created this image myself according to the algorithm described by E. Ukkonen. 1995 . On line construction of suffix trees. Algorithmica 14 3 249 260. Licensing PD self date October 2006 ... more details
Image Suffix tree ABAB BABA.svg thumb 300px right Suffix tree for the strings code ABAB code and code BABA code . Suffix tree Description Suffix links not shown. A generalised suffix tree is a suffix tree for a set of String computer science strings . Given the set of strings math D S 1,S 2, dots,S d math of total length math n math , it is a Patricia tree containing all math n math suffix computer science suffixes of the strings. It is mostly used in bioinformatics . ref BRCR Functionality It can be built in math Theta n math time and space, and can be used to find all math z math occurrences of a string math P math of length math m math in math O m z math time, which is asymptotically optimal assuming the size of the alphabet is constant, see ref Gus97 page 119 . When constructing such a tree, each string should be padded with a unique out of alphabet marker symbol or string to ensure no suffix is a substring of another, guaranteeing each suffix is represented by a unique leaf node. Algorithms for constructing a GST include Ukkonen s algorithm and McCreight s algorithm . Example A suffix tree for the strings code ABAB code and code BABA code is shown in a figure above. They are padded with the unique terminator strings code 0 code and code 1 code . The numbers in the leaf nodes are string number and starting position. Notice how a left to right traversal of the leaf nodes corresponds to the sorted order of the suffixes. The terminators might be strings or unique single symbols. Edges on code code from the root are left out in this example. Alternatives An alternative to building a generalised suffix tree is to concatenate the strings, and build a regular suffix tree or suffix array for the resulting string. When hits are evaluated after a search, global positions are mapped ..., John Riedl, John Carlis, and Ernest F. Retzel title Generalized Suffix Trees for Biological Sequence ... GST demo a web demo for generating a generalised suffix tree. Category Trees structure Category Algorithms ... more details
The Compressed Suffix Array ref name GV00 R. Grossi and J. S. Vitter, Compressed Suffix Arrays and Suffix Trees, with Applications to Text Indexing and String Matching , SIAM Journal on Computing, 35 2 , 2005, 378 407. An earlier version appeared in Proceedings of the 32nd ACM Symposium on Theory of Computing, May 2000, 397 406. ref ref name GGV03 R. Grossi, A. Gupta, and J. S. Vitter, High Order Entropy Compressed Text Indexes, Proceedings of the 14th Annual SIAM ACM Symposium on Discrete Algorithms, January 2003, 841 850. ref is a compressed data structure for pattern matching . Given a text T of n characters from an alphabet , the compressed suffix array support searching for arbitrary patterns in T . For an input pattern P of m characters, the search time is equal to n times the higher order entropy of the text T , plus some extra bits to store the empirical statistical model plus o n . The original instantiation of the compressed suffix array ref name GV00 solved a long standing open problem by showing that fast pattern matching was possible using only a linear space data structure, namely, one proportional to the size of the text T , which takes math O n , log Sigma n math bits. The conventional suffix array and suffix tree use math Omega n , log n math bits, which is substantially larger. The basis for the data structure is a recursive decomposition using the neighbor function, which allows a suffix array to be represented by one of half its length. The construction is repeated multiple times until the resulting suffix array uses a linear number of bits. Following work showed that the actual storage space was related to the zeroth order entropy and that the index supports ... on the Compressed Suffix Arrays, Proceedings of the International Symposium on Algorithms and Computation ... Equals Compression Experiments on Suffix Arrays and Trees , ACM Transactions on Algorithms , 2 4 ... suffix arrays and other compressed data structures for pattern matching are typically not localized ... more details
The Public Suffix List is a catalog of certain Internet domain name suffixes. A public suffix is also known by the older term effective top level domain eTLD . ref https wiki.mozilla.org Gecko Effective TLD List ref The Mozilla Foundation maintains suffix list for the security and privacy policies of its Mozilla Firefox Firefox web browser, though it is available for other uses under the Mozilla Public License . According to Mozilla, ref http publicsuffix.org ref quote A public suffix is one under which Internet users can directly register names. Some examples of public suffixes are .com , .co.uk and pvt.k12.wy.us . While .com , .uk and .us are top level domain s TLDs , Internet users cannot always register the next level of domain, such as co.uk or wy.us , since these may be controlled by domain name registrar domain registrar s. By contrast, users can register second level domains for .com , such as example.com , since registrars control only the top level of .com . The Public Suffix List is intended to enumerate all domain suffixes controlled by registrars. Some uses for the list are Avoiding supercookies , HTTP cookie s set for high level domain name suffixes. In other words, a page at foo.example.co.uk might normally have access to cookies at bar.example.co.uk, but example.co.uk should be walled off from cookies at example2.co.uk, since the latter two domains could be registered by different owners. Highlighting the most important part of a domain name in the user interface . Improving the sorting of browser history entries by site. References reflist External links http publicsuffix.org Public Suffix List Category Domain name system Category Mozilla web stub ... more details
cleanup date August 2008 Prediction Suffix Tree The concept of the Markov chain of order L, which we essentially owe to the Russian mathematician Andrey Markov Andrej Andreevic Markov 1907 , has two drawbacks. First, the number of parameters of the model grows exponentially with the order L of the chain. This brings about computational and storage problems during implementation, including for limited memory length L. An improvement initially put forward by Rissanen 1983 and used particularly in compression data Weinberger 1992, Willems 1995 was the Variable Length Markov chain Buhlmann 1999 . This model can be represented by a tree, known as Prediction Suffix Tree PST Ron 1996 , certain branches of which are depth L and others of an inferior depth to L, whereas the Markov chain of order L corresponds to a complete tree of depth L. By reducing the storage cost, pruning the branches of the tree will enable us to increase the order of the model and, thereby improve performance. References Prediction suffix trees for supervised classification of sequences http wotan.liu.edu docis lib sisl rclis dbl parele 2003 24 253A16 253C3153 253APSTFSC 253E eurise.univ st etienne.fr 252F largeron 252FPATREC.pdf Category Trees structure ... more details
Main Slavic surnames A Slavic name suffix is a common way of forming patronymic s, family name s, and pet names in the Slavic languages also called the Slavonic languages . Many, if not most, Slavic last names are formed by adding possessive suffix possessive and other suffix es to given names and other words. An example using an occupation is koval or kowal which means blacksmith. It is the root of the names Kowalsky , Kowalchuk , Kowalczyk , Kovalenko , Kovalyov , and Kovalev . All mean descendant of a blacksmith . The given name Petr or Petro equivalent to Peter can become Petrov , Petriv, Petriw, Petrovsky , Petrovich, and Petric . All mean descendant of Peter . This is similar to the use of son or sen in Germanic languages . For example Johnson means John s son , Anderson means Ander s son , etc. In East Slavic languages Belarussian, Russian, Rusyn, and Ukrainian the same phenomenon of name suffixes can be used to express several meanings. One of the most common is the patronymic. Instead of a secondary middle given name, people identify themselves with their given and family name and patronymic, a name based on their father s given name. If a man gives his full name as Boris Vladimirovich Kuznetsov, then his father s name must have been Vladimir. Vladimirovich in this case literally means Vladimir s son . Similarly suffixes can also be attached to express affection or informality. For example calling a boy named Ivan as Ivanko expresses that he is familiar to you. This the same as switching Jonathan for John or Johnny. See also Slavic surnames Bulgarian names Croatian name Czech names Polish names Russian names Serbian names Slovak name Ukrainian name Slavic names External links http userweb.ccomm.com sfpayer DB Slavic Rusyn 20Items.htm Slavic Name Endings by Dan Bavolack, Kathleen Dorsam, and Stephen F. Payer http en.allexperts.com q Russian Culture 2986 Russian Names 2.htm Russian Culture More Russian Names by Sergey Feduleyev http www.shokhirev.com nikolai lang ... more details
This is a list of actual or alleged scandal s named with a gate suffix , by analogy with the Watergate scandal . ref citation url http dictionary.oed.com title Oxford English Dictionary chapter gate, suffix publisher Oxford University Press ref Etymology, usage, and history of gate The suffix gate derives from the Watergate scandal of the United States in the early 1970s, which resulted in the resignation of President of the United States U.S. President Richard Nixon . Watergate itself does not follow the gate construction. The scandal was named after the Watergate complex in Washington, D.C. the complex itself was named after the Water Gate area where symphony orchestra concerts were staged on the Potomac River between 1935 and 1965. ref name WashingtonPostAnswerManWaterGate cite news url http www.washingtonpost.com wp dyn articles A60120 2004Dec12.html title Answer Man A Gate to Summers Past author John Kelly publisher The Washington Post date 2004 12 13 accessdate 2009 09 18 archiveurl http www.webcitation.org 5jsdEHs1g archivedate 2009 09 18 ref In 18th century Ireland, Richard Barry, 7th Earl of Barrymore was nicknamed Hellgate , ref http thepeerage.com p6661.htm thePeerage.com ref and his siblings Henry, Augustus and Carolina were nicknamed Cripplegate, Newgate and Billingsgate respectively, due to their scandalous behaviour. ref http books.google.ie books?id pgAnhYlGijgC&pg PA65 v onepage&q&f false Merriam Webster s Dictionary of Allusions ref All of these nicknames, except for Hellgate , were after gates in the walls of the City of London . The suffix is used to embellish a noun or name to suggest the existence of a far reaching scandal. As a CBC News Online column ... Stanyer comments that revelations are given the gate suffix to add a thin veil of credibility, following ... suffix Arts and Entertainment Baftagate Controversy surrounding votes at the 1991 BAFTA television ... the gate suffix. Mabel Wisse Smit Controversy Mabelgate The name given to the commotion around ... more details
Move to Commons Summary Generalized suffix tree for the words ABAB, BABA and ABBA. Vector version of Image Suffix tree.ABAB BABA ABBA.png . Licensing PD self date June 2008 ... more details
Encyclopedia
top
