Replace five exact English words with fixed output strings, then inspect every unchanged token instead of treating the result as a full translation.
The limited word-map output appears here...
These pairs expose whole-word boundaries, case normalization, repeated matches, punctuation retention, and text that the small mapping leaves untouched.
English
Hello, friend!
Translation
kaltxi, tsmukan!
Greeting and friend tokens replaced while punctuation remains
English
YES or no?
Translation
srane or kehe?
Uppercase yes and lowercase no converted to fixed lowercase outputs
English
People help people.
Translation
na'vi help na'vi.
Repeated people tokens changed while help stays in English
English
A friendly hello
Translation
A friendly kaltxi
Friendly remains unchanged because friend is not a standalone token
English
No people, yes friend.
Translation
kehe na'vi, srane tsmukan.
Four mapped words converted with comma and period preserved
English
hello-world people42
Translation
kaltxi-world people42
Hyphen creates a boundary while the digit-attached token does not match
| Order | Whole English Word | Fixed Output |
|---|---|---|
| 1 | hello | kaltxi |
| 2 | yes | srane |
| 3 | no | kehe |
| 4 | friend | tsmukan |
| 5 | people | na'vi |
The table lists the entire function in execution order; no hidden vocabulary or secondary lookup expands these rows.
These behaviors explain why most text remains English and why the result cannot substitute for a language reference.
| Input Feature | Observed Behavior | Limitation |
|---|---|---|
| Unlisted word | Copied as entered | No vocabulary lookup |
| Matched word case | Converted to fixed lowercase | Case is lost |
| Adjacent punctuation | Copied around output | No syntax analysis |
| Larger alphanumeric token | Usually not matched | Whole words only |
Compare friend, friendly, friend42, and friend-world to see where a regular-expression word boundary succeeds. This creates a compact programming exercise with visible inputs and outputs, without requiring any claims about fictional-language grammar.

A writer can mark one of the five replaced tokens as a temporary fan-style cue while leaving the English source beside it. The note should state that the page supplies no grammar, inflection, pronunciation, or dialogue review.
Use quotes, commas, question marks, or hyphens around mapped words to confirm that the converter changes tokens rather than rewriting sentence structure. This is helpful when documenting a deterministic text-processing pipeline.

When sharing an output, include the five-entry table and the date or implementation version you tested. That context prevents a site-specific replacement from being cited as a verified dictionary entry or franchise reference.

The page describes a small deterministic function and separates that function from language or franchise authority.
Visitors can inspect every possible English match and every fixed output without assuming that unlisted vocabulary receives any processing.
The same case-insensitive whole-word rules run in the same sequence, while spaces, punctuation, and unmatched text remain outside the map.
The converter does not select sentence structure, interpret intent, check pronunciation, or decide whether a phrase belongs in any established language resource.
Names and search terms identify the page topic, while the supporting copy avoids certifying its five output strings as franchise-approved vocabulary.
Answers refer only to the replacement function available on this page.
Check out these related translation and AI tools to enhance your experience
Use the tool as a transparent replacement demonstration and label the output so readers do not mistake unchanged English for translated language.
Start with one or more of the five documented English entries. Other vocabulary will stay as supplied, so a long sentence mostly demonstrates the map's limits rather than broader language coverage.
Check that each standalone match uses its listed lowercase output and that commas, hyphens, spaces, and unlisted words remain in their original positions.
Save the English phrase beside the result and identify it as a five-entry fan map. The output alone cannot support claims about grammar, pronunciation, or accepted usage.
Enter a short test phrase, compare it with the complete five-row table, and retain the English source beside any fan-style draft.