Collation is the assembly of written information into a standard order. Many systems of collation are based on numerical order or alphabetical order, or extensions and combinations thereof. Collation is a fundamental element of most office filing systems, library catalogs and reference books.

Collation differs from classification in that classification is concerned with arranging information into logical categories, while collation is concerned with the ordering of items of information, usually based on the form of their identifiers. Formally speaking, a collation method typically defines a total order on a set of possible identifiers, called sort keys, which consequently produces a total preorder on the set of items of information (items with the same identifier are not placed in any defined order).

A collation algorithm such as the Unicode collation algorithm defines an order through the process of comparing two given character strings and deciding which should come before the other. When an order has been defined in this way, a sorting algorithm can be used to put a list of any number of items into that order.

The main advantage of collation is that it makes it fast and easy for a user to find an element in the list, or to confirm that it is absent from the list. In automatic systems this can be done using a binary search algorithm or interpolation search; manual searching may be performed using a roughly similar procedure, though this will often be done unconsciously. Other advantages are that one can easily find the first or last elements on the list (most likely to be useful in the case of numerically sorted data), or elements in a given range (useful again in the case of numerical data, and also with alphabetically ordered data when one may be sure of only the first few letters of the sought item or items).

Numerical and chronological order[link]

Strings representing numbers may be sorted based on the values of the numbers that they represent. For example, "-4", "2.5", "10", "89", "30,000". Note that pure application of this method may provide only a partial ordering on the strings, since different strings can represent the same number (as with "2" and "2.0", or when scientific notation is used, "2e3" and "2000").

A similar approach may be taken with strings representing dates or other items that can be ordered chronologically or in some other natural fashion.

Alphabetical order[link]

Alphabetical order is the basis for many systems of collation where items of information are identified by strings consisting principally of letters from an alphabet. The ordering of the strings relies on the existence of a standard ordering for the letters of the alphabet in question. (The system is not limited to alphabets in the strict technical sense; languages that use a syllabary or abugida, for example Cherokee, can use the same ordering principle provided there is a set ordering for the symbols used.)

To decide which of two strings comes first in alphabetical order, initially their first letters are compared. The string whose first letter appears earlier in the alphabet comes first in alphabetical order. If the first letters are the same, then the second letters are compared, and so on, until the order is decided. (If one string runs out of letters to compare, then it is deemed to come first; for example, "cart" comes before "carthorse".) The result of arranging a set of strings in alphabetical order is that words with the same first letter are grouped together, and within such a group words with the same first two letters are grouped together and so on.

Capital letters are normally treated as equivalent to their corresponding lowercase letters.

Certain limitations, complications and special conventions may apply when alphabetical order is used:

• When strings contain spaces or other word dividers, the decision must be taken whether to ignore these dividers or to treat them as "letters" preceding all other letters of the alphabet. For example, if the first approach is taken then "car park" will come after "carbon" and "carp" (as it would if it were written "carpark"), whereas in the second approach "car park" will come before those two words. The first rule is used in many (but not all) dictionaries, the second in telephone directories (so that Wilson, Jim K appears with other people named Wilson, Jim and not after Wilson, Jimbo).
• Abbreviations may be treated as if they were spelt out in full. For example, names containing "St." (short for the English word Saint) are often ordered as if they were written out as "Saint". There is also a traditional convention in English that surnames beginning Mc and M' are listed as if those prefixes were written Mac.
• Strings that represent personal names will often be listed by alphabetical order of surname, even if the given name comes first. For example, Juan Hernandes and Brian O'Leary should be sorted as "Hernandes, Juan" and "O'Leary, Brian" even if they are not written this way.
• Very common initial words, such as The in English, are often ignored for sorting purposes. So The Shining would be sorted as just "Shining" or "Shining, The".
• When some of the strings contain numerals (or other non-letter characters), various approaches are possible. Sometimes such characters are treated as if they came before or after all the letters of the alphabet. Another method is for numbers to be sorted alphabetically as they would be spelled: for example 1776 would be sorted as if spelled out "seventeen seventy-six", and 24 heures du Mans as if spelled "vingt-quatre..." (French for "twenty-four"). When numerals or other symbols are used as special graphical forms of letters, as 1337 for leet or the movie Se7en, they may be sorted as if they were those letters.
• Languages have different conventions for treating modified letters and certain letter combinations. For example, in Spanish the letter ñ is treated as a basic letter following n, and the digraphs ch and ll were formerly (until 1994) treated as basic letters following c and l, although they are now alphabetized as two-letter combinations. A list of such conventions for various languages can be found at Alphabetical order: Language-specific conventions.

In several languages the rules have changed over time, and so older dictionaries may use a different order than modern ones. Furthermore, collation may depend on use. For example, German dictionaries and telephone directories use different approaches.

Radical-and-stroke sorting[link]

Another form of collation is radical-and-stroke sorting, used for non-alphabetic writing systems such as Chinese hanzi and Japanese kanji, whose thousands of symbols defy ordering by convention. In this system, common components of characters are identified; these are called radicals in Chinese and logographic systems derived from Chinese. Characters are then grouped by their primary radical, then ordered by number of pen strokes within radicals. When there is no obvious radical or more than one radical, convention governs which is used for collation. For example, the Chinese character for "mother" (妈) is sorted as a six-stroke character under the three-stroke primary radical (女).

The radical-and-stroke system is cumbersome compared to an alphabetical system in which there are a few characters, all unambiguous. The choice of which components of a logograph comprise separate radicals and which radical is primary is not clear-cut. As a result, logographic languages often supplement radical-and-stroke ordering with alphabetic sorting of a phonetic conversion of the logographs. For example, the kanji word ''Tōkyō (東京), the Japanese name of Tokyo can be sorted as if it were spelled out in the Japanese characters of the hiragana syllabary as "to-u-ki-_yo-u" (とうきょう), using the conventional sorting order for these characters.

In addition, in Greater China, surname stroke ordering is a convention in some official documents where peoples' names are listed without hierarchy.

The radical-and-stroke system, or some similar pattern-matching and stroke-counting method, was traditionally the only practical method for constructing dictionaries that someone could use to look up a logograph whose pronunciation was unknown. With the advent of computers, dictionary programs are now available that allow one to draw a character using a mouse or stylus.

Automated collation[link]

When information is stored in digital systems, collation may become an automated process. It is then necessary to implement an appropriate collation algorithm that allows the information to be sorted in a satisfactory manner for the application in question. Often the aim will be to achieve an alphabetical or numerical ordering that follows the standard criteria as described in the preceding sections. However, not all of these criteria are easy to automate.

The simplest kind of automated collation is based on the numerical codes of the symbols in a character set, such as ASCII coding (or any of its supersets such as Unicode), with the symbols being ordered in increasing numerical order of their codes, and this ordering being extended to strings in accordance with the basic principles of alphabetical ordering (mathematically speaking, lexicographical ordering). So a computer program might treat the characters a, b, C, d and $ as being ordered $, C, a, b, d (the corresponding ASCII codes are $ = 36, a = 97, b = 98, C = 67, and d = 100). Therefore strings beginning with C (or any other capital letter) would be sorted before strings with lower-case a, b, etc. This is sometimes called ASCIIbetical order.

The above method has the disadvantage that it can deviate from the standard alphabetical order that human users would expect, particularly due to the unexpected ordering of capital letters before all lower-case ones (and possibly the unexpected treatment of spaces and other non-letter characters). It is therefore often applied with certain refinements, the most obvious being the conversion of capitals to lowercase before comparing ASCII values.

In many collation algorithms, the comparison is based not on the numerical codes of the characters, but with reference to the collating sequence – a sequence in which the characters are assumed to come for the purpose of collation – as well as other ordering rules appropriate to the given application. This can serve to apply the correct conventions used for alphabetical ordering in the language in question, dealing properly with differently cased letters, modified letters, digraphs, particular abbreviations and so on, as mentioned above under Alphabetical order, and in detail in the Alphabetical order article. Such algorithms are potentially quite complex, possibly requiring several passes through the text.^[1]

Problems are nonetheless still common when the algorithm has to encompass more than one language. For example, in German dictionaries the word ökonomisch comes between offenbar and olfaktorisch, while Turkish dictionaries treat o and ö as different letters, placing oyun before öbür.

A standard algorithm for collating any collection of strings composed of any standard Unicode symbols is the Unicode Collation Algorithm. This can be adapted to use the appropriate collation sequence for a given language by tailoring its default collation table. Several such tailorings are collected in Common Locale Data Repository.

Sort keys[link]

In some applications, the strings by which items are collated may differ from the identifiers that are displayed. For example, The Shining might be sorted as Shining, The (see Alphabetical order above), but it may still be desired to display it as The Shining. In this case two sets of strings can be stored, one for display purposes, and another for collation purposes. Strings used for collation in this way are called sort keys.

Issues with numbers[link]

Sometimes, it is desired to order text with embedded numbers using proper numerical order. For example, "Figure 7b" goes before "Figure 11a", even though '7' comes after '1' in Unicode. This can be extended to Roman numerals. This behavior is not particularly difficult to produce as long as only integers are to be sorted, although it can slow down sorting significantly. For example, Windows XP does this when sorting file names.

Sorting decimals properly is a bit more difficult, because different locales use different symbols for a decimal point, and sometimes the same character used as a decimal point is also used as a separator, for example "Section 3.2.5". There is no universal answer for how to sort such strings; any rules are application dependent.

Ascending order of numbers differs from alphabetical order, e.g. 11 comes alphabetically before 2. This can be fixed with leading zeros: 02 comes alphabetically before 11. See e.g. ISO 8601.

Also −13 comes alphabetically after −12 although it is less. With negative numbers, to make ascending order correspond with alphabetical sorting, more drastic measures are needed such as adding a constant to all numbers to make them all positive.

Labeling of ordered items[link]

In some contexts, numbers and letters are used not so much as a basis for establishing an ordering, but as a means of labeling items that are already ordered. For example, pages, sections, chapters and the like, as well as the items of lists, are frequently "numbered" in this way. Labeling series that may be used include ordinary Arabic numerals (1, 2, 3, ...), Roman numerals (I, II, III, ... or i, ii, iii, ...), or letters (A, B, C, ... or a, b, c, ...). (An alternative method for indicating list items, without numbering them, is to use a bulleted list.)

When letters of an alphabet are used for this purpose of enumeration, there are certain language-specific conventions as to which letters are used. For example, the Russian letters Ъ and Ь (which in writing are only used for modifying the preceding consonant), and usually also Ы, Й and Ё, are usually omitted. Also in many languages that use extended Latin script, the modified letters are often not used in enumeration.

See also[link]

• Alphabetical order
• Sorting
• Taxonomic sequence

Notes[link]

External links and references[link]

Look up collation or alphabetization in Wiktionary, the free dictionary.

• Unicode Collation Algorithm: Unicode Technical Standard #10
• Collation in Spanish
• Collation of the names of the member states of the United Nations
• Typographical collation for many languages, as proposed in the List module of Cascading Style Sheets.
• Collation Charts: Charts demonstrating language-specific sorting orders in various operating systems and DBMS
• ICU Locale Explorer: An online demonstration of sorting in different languages that uses the Unicode Collation Algorithm with International Components for Unicode

Cem Yılmaz (born 23 April 1973 in Istanbul, Turkey) is a Turkish stand-up comedian, actor and filmmaker and cartoonist, best known for his films G.O.R.A. (2004), A.R.O.G (2008) and Yahşi Batı (2010), who has won two Sadri Alışık awards for his roles in Organize İşler (2005) and The Magician (2006).

Biography[link]

While studying at the Department of Tourism and Hotel Management of Boğaziçi University, he started drawing comics for the Turkish humor magazine Leman. In August 1995 he did his first stand-up comedy show in "Leman Culture Center" performing with no serious career intentions as a comedian. However, after the positive response of the audience, he continued his show to attract larger crowds in Beşiktaş Cultural Center where he has appeared in over a thousand stand-up comedy shows since, becoming so popular that tickets have sold for 250TL (approx. US$140). His movie career started in 1998 with a co-starring role in the comedy Everything's Gonna Be Great (1999), directed by Ömer Vargı, and continued with a role in Vizontele (2001), directed by Yılmaz Erdoğan and Ömer Faruk Sorak. He achieved his greatest success by starring in and writing big-budget science-fiction parody G.O.R.A. (2004), also directed by Ömer Faruk Sorak, which despite spending several years in production because of financial and other technical problems became a box-office hit and, according to Rekin Teksoy, "showed that popular cinema was successful in appealing to wide audiences".^[2] He followed this success with a starring role in the comedy Organize İşler (2005), also directed by Yılmaz Erdoğan, for which he won Best Supporting Actor at the 11th Sadri Alışık Awards, and his directorial debut with The Magician (2006), co-directed by Ali Taner Baltacı, for which he won Best Actor at the 34th Brussels International Independent Film Festival and 12th Sadri Alışık Awards. He has since repeated his box office success with a sequel to G.O.R.A. called A.R.O.G (2008), also co-directed by Ali Taner Baltacı, and comedy Western parody called Yahşi Batı (2010), directed by Ömer Faruk Sorak. That same year, he co-starred, alongside veteran actor Şener Şen, in the police drama Hunting Season (2010), written and directed by Yavuz Turgul, and made a special appearance in drama Zephyr (2010), written and directed by Belma Baş.

Filmography[link]

References[link]

External links[link]

• Cem Yılmaz at the Internet Movie Database
• Cem Yılmaz's official website
• Turkish Cem Yılmaz's Biography

v t e Cinema of Turkey Actors · Awards · Directors · Cinematographers · Editors · Festivals  · Producers · Production companies · Score composers · Screenwriters · Turkish films by year (category) · A–Z of Turkish films Pre-1930 · 1930s · 1940s · 1950s · 1960s · 1970s · 1980s · 1990s · 2000s · 2010s

DJ Premier
Background information
Birth name	Christopher Edward Martin
Born	(1966-03-21) March 21, 1966 (age 46) Houston, Texas, United States
Origin	Houston, Texas, USA
Genres	Hip hop, East Coast Hip Hop
Occupations	Record producer, DJ
Instruments	Drum machine Keyboard Sampler Turntable
Years active	1984 – present
Labels	Wild Pitch/EMI (1987–1990) Chrysalis/EMI (1991–1998) Virgin/EMI (1998–2003) Year Round (2003–)
Associated acts	Gang Starr Foundation, M.O.P., Royce da 5'9", Christina Aguilera, Jay-Z, Kanye West, Nas, Kool G Rap, Blaq Poet, Apathy, Big L, Bun B, D.I.T.C., Game, Termanology, AZ, Buckshot LeFonque, Mobb Deep, Torae
Website	DJ Premier on Myspace

Christopher Edward Martin (born March 21, 1966),^[1] better known by his stage name DJ Premier (also known as Preem, Premo, or Primo for short), is an American record producer and DJ, and was the instrumental half of the hip hop duo Gang Starr, together with emcee Guru. Born in Houston and raised in Prairie View, Texas, he has lived in Brooklyn, New York, for much of his professional career. Rolling Stone identified Premier as arguably Hip-Hop's greatest producer of all time.^[2]

The Source named DJ Premier one of the five greatest producers in hip-hop history,^[3] while the editors of About.com ranked him #1 on their Top 50 Hip-Hop Producers list.^[4] He also made the "Finals" in the search for The Greatest Hip-Hop Producer of All Time by Vibe.^[5] He attended Prairie View A&M University.^[6]

Productions[link]

Premier is known for producing all of Gang Starr's songs as well as many of the Gang Starr Foundation's songs. His work also includes production for heavyweight rappers such as (alphabetic order) Apathy, Big L, Bun B, Canibus, D.I.T.C., Fat Joe, Game, Jay-Z, Kanye West, KRS-One, Lord Finesse, M.O.P., Mos Def, Nas, Rakim, Royce Da 5'9", The LOX, The Notorious B.I.G., Snoop Dogg, Xzibit, rock band Limp Bizkit, Big L, Big Daddy Kane, Ill Bill, Joell Ortiz, and pop/R&B singer Christina Aguilera, among many others.

Premier collaborated with MC Jeru the Damaja on the album The Sun Rises in the East, released in 1994, as well as the 1996 follow-up, Wrath of the Math.^[1] Also from the Gang Starr Foundation, Premier produced and supervised Group Home's Livin' Proof; although overlooked at the time of its 1995 release, the album has since come to find similar acclaim.^[1] Among others in that are closely tied to the Gang Starr Foundation who have worked with DJ Premier include Afu Ra, Bahamadia, Krumbsnatcha, Big Shug, Smiley the Ghetto Child, and NYGz. He recently produced the majority of Blaq Poet's Tha Blaqprint in 2009 and will produce the entirety of NYGz debut album.

Style and influences[link]

DJ Premier's style of production epitomizes the New York sound of his earlier peers. He is known for sampling jazz, funk, and soul artists, as well as sampling an artist's past work when creating a new track for that same artist. For example, on Jay-Z's "So Ghetto", from the 1999 album, Vol. 3… Life and Times of S. Carter, Premier samples an older Jay-Z song, 1997's "Who You Wit II".^[7] In addition, his encyclopedic memory of hip-hop lyrics allows him to distinctively speak with his hands by scratching in lyrics from several different songs to construct new phrases.^[8] Premier's beats are known for his oft-imitated combinations of short vocal samples, often from multiple artists, to create a chorus. Premier has also experimented with atonal samples that are not confined to soul, jazz, and funk. For example, he sampled chopped up seminal electro-acoustic music from the 1960s on the track “Mental Stamina” by Jeru the Damaja.

In an interview with XXL Magazine, DJ Premier was asked how his sound evolved, to which he replied, "Marley Marl is my number one inspiration. Jam Master Jay, Mixmaster Ice and UTFO. Grandmaster D and Whodini. DJ Cheese, Grandmaster Flash, Kool Herc, Afrika Bambaataa. Jazzy Jay, even Cut Creator. Seeing them do what they do. It’s black music, it’s black culture, it comes from the ghetto. How can you not relate to ghetto people when that’s the rawest form of blackness? Even though it’s not a good place in regards to the economy and how bad people have it in the neighborhood, the realism’s there, and that’s what we were born out of. So I very much pay respect by doing the same type of music in return." DJ Premier attended Prairie View A & M University and may have been influenced by the musical atmosphere at the university.^[9]

Relationships with artists[link]

The early line-up of the Gang Starr Foundation in the mid-1990s included Jeru The Damaja, Group Home, Big Shug, and Gang Starr. DJ Premier was fully responsible for the production of Jeru the Damaja's first two albums, The Sun Rises in the East and Wrath of the Math. Jeru released three albums since then, with Premier having nothing to do with any of them.^[1]

As far as Group Home was concerned, Premier commented, "They don't respect what fed them," in a 2003 interview, going on to say that the only reason he produced a track on their second album was because Guru said he would rhyme on it.^[10]

Besides the Gang Starr Foundation, Premier is closely affiliated with M.O.P., which he names as one of his all-time favorite groups. The relationship started with the remix of “Rugged, Neva Smoove” in 1994, a single from the group's first album, which also included the exclusive B-side “Downtown Swinga.” From then, Premier produced about one-third of the songs on each subsequent album and overseeing and mixing the projects. On M.O.P.'s 2009 Foundation album, however, DJ Premier provided only one track, which was called "What I Wanna B."

Recent and future projects[link]

DJ Premier has his own record company named Year Round Records. Among its artists are New York group NYGz, New Jersey rapper Nick Javas, and Houston rapper Khaleel. Tha Blaqprint by Blaq Poet, which has thirteen Premier productions, was released by Year Round Records through Fat Beats Records. On December 7, Premier's label Year Round Records released a digital compilation album titled Get Used to Us. At the moment Year Round plans to release a debut album fully produced by DJ Premier with the NYGz tenatively called Hustla's Union: Local NYG along with a Nick Javas debut album named Destination Unknown. Khaleel, another label-mate of Year Round Records, is planned to release a debut album titled Already!.

DJ Premier hosts a weekly 2 hour show Live From HeadQCourterz on SIRIUS Satellite Radio's Hip-Hop Nation on Fridays.

DJ Premier was one of the artists followed in the 2012 documentary Re:GENERATION music project. The film followed his production of the song Regeneration using live performance of his work by the Berklee Symphony Orchestra [1]

In a recent interview, DJ Premier said he will produce a beat for Immortal Technique's upcoming album, titled The Middle Passage. He contributed a song on Game's last album The R.E.D. Album called "Born in the Trap." and a song on Bushido's last album Jenseits von Gut und Böse.^[6] In an interview in 2012, DJ Premier confirmed on Shade45 that he is working with Eminem on his upcoming album.

Discography[link]

• The Sun Rises in the East (with Jeru The Damaja) (1994)
• Livin' Proof (with Group Home) (1995)
• Wrath of the Math (with Jeru The Damaja) (1996)
• Beats That Collected Dust (2008)
• Tha Blaqprint (with Blaq Poet) (2009)
• DJ Premier Presents Get Used To Us (2010)
• Beats That Collected Dust Vol. 2 (2011)
• Premo Pimpin' EP (with Wais P) (2011)
• StOoDiOtYmE EP (with Bumpy Knuckles) (2012)
• The Kolexxxion (with Bumpy Knuckles) (2012)
• TBA (with Nas)
• TBA (with M.O.P.)
• Pete Rock v.s. Premier (with Pete Rock)
• Return Of The Boom Bip (with KRS-ONE)

References[link]

External links[link]

• DJ Premier on Twitter
• DJ Premier at Allmusic
• DJ Premier discography at Discogs
• Fansite/newsite about DJ Premier