File naming pattern
A naming model is judged on a real folder, not on an example. Choose your tokens, drop your documents, and read the “after” column.
Or drop a folder, to see what your naming pattern would give here. Nothing is sent: everything stays in this tab.
When to use it
The firm wants to settle a convention and hesitates between {date}_{type}_{personne} and {personne}/{date}_{type}.
Or you take over a folder from elsewhere and must bring it in line with the house convention.
What this tool does
- Six ready-made patterns: by date, by person, by issuer, numbered for a list of documents, and the house pattern.
- Empty tokens disappear cleanly: when the issuer is unknown, the name does not keep an orphan separator.
- The pattern is checked before it is applied: an unknown token is reported, not ignored.
- The original name stays available with
{original}, when traceability matters more than readability.
What it does not do: a naming pattern does not create missing information. If the document states no date, {date} stays empty, and the tool will not go looking elsewhere.
What is read in the document
- What the identification found, and nothing more.
No file is uploaded: the folder is read by your browser, in this tab, and the page is not allowed to open a connection to any other site.
Frequently asked questions
- Can the original name be kept inside the new one?
- Yes, with the
{original}token. That is what firms do when they want to be able to trace back to the document as it arrived. - Are accents preserved?
- Yes. Characters a file system refuses are replaced, and the tool says so row by row.
The other tools
- Rename a folder of files : A naming pattern applied to a whole folder, with the before and after preview and the undo.
- Identify the documents in a folder : A whole folder read at once: the type of each document, its date, its issuer, the person.
- Identify one document : One document, one answer, and the clues that produced it.
- Sort a folder into a tree : By family, by person, by year, by issuer: the tree is proposed, never imposed.
- Find duplicates : Byte-for-byte identicals, scans proposed as duplicates, and the series that are not.