Definition from Wiktionary, the free dictionary
Jump to navigation Jump to search
Babel user information
th-N ผู้ใช้คนนี้ใช้ภาษาไทยเป็นภาษาแม่
en-3 This user has advanced knowledge of English.
zh-1 这位用户的中文达到初级水平
cmn-1 This user has basic knowledge of Mandarin Chinese.
{{t}}-3 This user can write more complex wiki templates.
JS-3 This user can write more complex JavaScript code, and can understand and modify most scripts written by others.
lua-3 This user can write more complex Lua modules.
Users by language
UTC+7 This user's time zone is UTC+7.

  • 🏠 Thai Wikipedia and Thai Wiktionary
  • 🇹🇭󠁔󠁈 Thailand
  • 🎓 B.Sc. (Computer Science) and B.B.A. (Marketing major)
  • 🤖 User:OctraBot
  • 😅 Sorry if I re-edit too much on any page.
  • 😵 I work on many languages that are easy to learn.


Needs cleanup[edit]


  • My collection of sources that I found online.
  • It is impossible that a reconstructed term is borrowing from another language (but it can be derived).
  • The terms one, two, three, etc in languages must be put under numeral (not number) categories or they will not be lemmas.
  • Loan blend or hybrid loanword refers to a compound that combines ad hoc loanword and already existing word in the language. Wiktionary does not have category or template to express this case. We must choose either common compound or borrowing term.


Technical issues[edit]

  • Proto-Tai tones denote as ᴬ ᴮ ᶜ ᴰ. There is no superscript uppercase C in Unicode, so lowercase is used instead.
  • Arbitrary PUAs are not allowed. For Han characters, use IDS instead until it is available in Unicode.
  • Some Han characters may have 2 indices. Here is the list of ALL secondary indices:
  • 12 code points in CJK Compatibility Ideographs range
    , , , , , , , , , , ,
    (U+FA0E, U+FA0F, U+FA11, U+FA13, U+FA14, U+FA1F, U+FA21, U+FA23, U+FA24, U+FA27, U+FA28, and U+FA29)
    lack a canonical Decomposition_Mapping value in UnicodeData.txt and so are not true CJK Compatibility Ideographs. These twelve characters should be treated as proper CJK Unified Ideographs.

How to find anagrams

  1. Get a list of every word in a language.
  2. Make index for every entry by sorting its letters, with or without diacritics. (See alphagram)
  3. Collect entries which indices matches each other.
  4. Drop unmatched isolate entries.